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

const int N=1e5;
int n,m;
int to[N],nxt[N],h[N],tot,deg[N],DEG[N],dis[N],maxx;

void add(int x,int y)
{
	to[++tot]=y;
	nxt[tot]=h[x];
	h[x]=tot;
	deg[y]++;
	DEG[y]++;
}

void topsort()
{
	queue<int> q;
	memset(dis,0,sizeof dis);
	maxx=0;
	for(int i=1;i<=26;i++)
	{
		if(deg[i]==0)q.push(i);
		dis[i]=1;
	}
	while(q.size())
	{
		int x=q.front();
		q.pop();
		for(int i=h[x];i;i=nxt[i])
		{
			int y=to[i];
			dis[y]=max(dis[y],dis[x]+1);
			maxx=max(maxx,dis[y]);
			if(--deg[y]==0)
			{
				q.push(y);
			}
		}
	}
}

int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		char x,y;
		cin>>x;
		scanf("<");
		cin>>y;
		for(int j=1;j<=26;j++)deg[j]=DEG[j];
		add(x-'A'+1,y-'A'+1);
		topsort();
		for(int j=1;j<=26;j++)
		{
			if(deg[j]!=0)
			{
				cout<<"Inconsistency found after "<<i<<" relations.";
				return 0;
			}
		}
		if(maxx==n)
		{
			cout<<"Sorted sequence determined after "<<i<<" relations: ";
			for(int i=1;i<=n;i++)
			{
				cout<<dis[i]<<" ";
				cout<<(char)(dis[i]+'A'-1)<<endl;
			}
			cout<<".";
			return 0;
		}
	}
	cout<<"Sorted sequence cannot be determined.";
	return 0;
}