#include<bits/stdc++.h>
using namespace std;
int n,x[114514],f[101][101],sum[114514],ans[114514],t;
void dfs(int a)
{
	for(int i1=1;i1<=n;i1++)
	{
		if(x[i1]==0&&sum[i1]==0)
		{
			x[i1]=1;
			ans[++t]=i1;
//			cout<<i<<" ";
			for(int j1=1;j1<=n;j1++)if(x[j1]==0&&f[j1][i1]==1)sum[j1]--;
			dfs(a);
			for(int j1=1;j1<=n;j1++)if(x[j1]==0&&f[j1][i1]==1)sum[j1]++;
			goto sa;
		}
	}
	sa:;
}
int a,m,b;
char a1,b1;
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		memset(ans,0,sizeof(ans));
		memset(x,0,sizeof(x));
		t=0;
		scanf("%c<%c",&a1,&b1);
		a=int(a1)-64,b=int(b1)-64;
		if(f[a][b]==1)
		{
			printf("Inconsistency found after %d relations.",i);
			return 0;
		}
		f[b][a]=1,sum[b]++;
		dfs(i);
		for(int j=1;j<=n;j++)if(x[j]==0)goto sb;
		printf("Sorted sequence determined after %d relations: ",i);
		for(int j=1;j<=n;j++)cout<<char(ans[j]+64)<<" ";
		return 0;
		sb:;
	}
	printf("Sorted sequence cannot be determined.");
}