#include <fstream>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <set>
#include <cstring>
#include <map>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#define oo 2000000
#define MOD 1000000007
using namespace std;

ifstream fin("a.in");
ofstream fout("a.out");

vector<int>L[26];
int grad[26],fol[26];
int n, m,x,y;
priority_queue<int, vector<int>, greater<int> > q;
void sorttop()
{
    for (int i = 0; i < 26; i++)
    {
        if (grad[i] == 0 && fol[i]==1)
            q.push(i);
    }
    while (!q.empty())
    {
        int x = q.top();
        fout << char(x + 'a');
        q.pop();
        for (auto next : L[x])
        {
            grad[next]--;
            if (grad[next] == 0 && fol[next] == 1)
            {
                q.push(next);
            }
        }
    }
}
int main()
{
    string s;
    fin >> n >> m;
    while (m--)
    {
        fin >> s;
        if (s[1] == '>')
        {
            L[s[2] - 'a'].push_back(s[0] - 'a');
            grad[s[0] - 'a']++;
            
        }
        else
        {
            L[s[0] - 'a'].push_back(s[2] - 'a');
            grad[s[2] - 'a']++;
        }
        fol[s[0] - 'a'] = 1;
        fol[s[2] - 'a'] = 1;
        
        
    }
    sorttop();

 }