//2538224 2010-06-13 15:25:40 Accepted 1811 31MS 640K 2121 B C++ T&T
//把=号用并查集处理以后(所有同一集合的数字用根数字来表示)就是显而易见的拓扑排序了
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#define MAX 10010
using namespace std;
vector<int>cost[MAX];
int deep[MAX],count[MAX],save[20005][2];
int find(int x)
{
int r,j;
r = x;
while(r != p[r])
{
j = r;
r = p[r];
p[j] = p[r]; //压缩路径
}
return r;
}
void merge(int x,int y)
{
int fx,fy;
fx = find(x);
fy = find(y);
if(fx != fy)
{
if(deep[fx] > deep[fy])
{
p[fy] = fx;
} //深度小的数加到深度大的树下可以尽量减少树的深度减少查询时间
else
{
p[fx] = fy;
if(deep[fx] == deep[fy])
{
deep[fy]++; //深度相同的树相加 数的深度才会增加
}
}
}
}
int Toposort(int n)
{
int top = -1,i,k,num = 0,j,x;
int res = 1;
for(i = 0; i < n; i++)
{
if(count[i] == 0 && find(i) == i)
{
count[i] = top;
top = i;
num++;
}
}
if(num > 1)
{
res = 2;
}//uncertain
else if(num == 0)
{
return 3;
}
for(i = 0; i < n; i++)
{
num = 0;
if(find(i) == i) //这个地方纠结了一个夜 忘了考虑本题不是所有的元素都拿来排序的直接抄模板错了6 7次
{//数组下标模拟堆栈
if(top == -1)//循环次数少于图的点数 即当所有的点入度都不为0却还有点未取出 就是有环存在的情况
{
//res = 3;
return 3; //冲突优于信息不全
}
else
{
j = top;
top = count[top];
for(k = 0; k < cost[j].size(); k++)
{
x = cost[j][k];
if((--count[x]) == 0)
{
count[x] = top;
top = x;
num++;
}
}
if(num > 1) //uncertain
{
res = 2;
}
}
}
}
return res;
}
int main()
{
int n,m,i,a,b,t,d,ans;
char sign;
while(scanf("%d%d",&n,&m) != EOF)
{
d = 0;
// memset(count,0,sizeof(count));
for(i = 0; i <= n; i++)
{
count[i] = 0;
deep[i] = 1;
p[i] = i;
cost[i].clear();
}
for(i = 0; i < m; i++)
{
scanf("%d%s%d",&a,&sign,&b);
if(sign != '=')
{
if(sign == '>')
{
//count[save[i][0]]++;
t = a;
a = b;
b = t;
} //这里先交换保障 save[i][1]要大以便后面的操作
save[d][0] = a;save[d++][1] = b;
}
else
{
merge(a,b); //等于用并查集处理
}
}
for(i = 0; i < d; i++)
{
a = find(save[i][0]);
b = find(save[i][1]);
cost[a].push_back(b); //建边
count[b]++;
}
ans = 1;
ans = Toposort(n);
if(ans == 1)
{
printf("OK/n");
}
else if(ans == 2)
{
printf("UNCERTAIN/n");
}
else if(ans == 3)
{
printf("CONFLICT/n");
}
}
}