// Arup Guha
// 6/15/2023
// Solution to SIUCF CP Contest 2 Problem: Rank Problem
// https://open.kattis.com/problems/rankproblem

using namespace std;
#include <bits/stdc++.h>

int find(vector<int> v, int item);

int main() {

    int n, k;
    cin >> n >> k;

    // Perm stores where everything is.
    vector<int> perm(n);
    for (int i=0; i<n; i++)
        perm[i] = i;

    // Go through each game.
    for (int i=0; i<k; i++) {

        // Extract teams.
        string win, loss;
        cin >> win >> loss;
        int W = stoi(win.substr(1, win.size()-1))-1;
        int L = stoi(loss.substr(1, loss.size()-1))-1;

        // Find their rank.
        int idxW = find(perm, W);
        int idxL = find(perm, L);

        // Remove and insert the loser in this case.
        if (idxW > idxL) {
            perm.erase(perm.begin()+idxL);
            perm.insert(perm.begin()+idxW, L);
        }
    }

    // Ta da!
    for (int i=0; i<n; i++)
        cout << "T" << perm[i]+1 << " ";
    cout << endl;

    return 0;
}

// Returns the first index in v storing item.
int find(vector<int> v, int item) {
    for (int i=0; i<v.size(); i++)
        if (v[i] == item)
            return i;
    return -1;
}