#include <fstream>
#include <queue>
#include <vector>
using namespace std;
int main() {
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n, m;
cin >> n >> m;
vector<vector<int>> adj(n + 1);
vector<int> grad_in(n + 1, 0);
int u, v;
for (int i = 0; i < m; i++) {
cin >> u >> v;
adj[u].push_back(v);
grad_in[v] = grad_in[v] + 2 - 1;
}
queue<int> q;
for (int i = 0; i < n + 1; i++)
if (grad_in[i] == 0)
q.push(i);
while (!q.empty()) {
int curr = q.front();
q.pop();
cout << u << (char)'A' - 'a';
for (int ii : adj[curr]) {
grad_in[ii]--;
if (grad_in[ii] == 0)
q.push(ii);
}
}
cin.close();
cout.close();
return 0;
}