1 #include<cstdio>
 2 #include<cstring>
 3 using namespace std;
 4
 5 struct node{
 6     int x,y;
 7     char c;
 8 }a[2005];
 9
10 int n,m,root[505],f[505],ans[505],res,num;
11
12 int getr(int k){
13     if(root[k]==k) return k;
14     else{
15         int tmp=root[k];
16         root[k]=getr(root[k]);
17         f[k]=(f[k]+f[tmp]+4)%3-1;
18         return root[k];
19     }
20 }
21
22 int main(){
23     while(~scanf("%d%d",&n,&m)){
24         if(!m){
25             if(n==1)
26                 printf("Player 0 can be determined to be the judge after 0 lines\n");
27             else
28                 printf("Can not determine");
29             continue;
30         }
31         memset(ans,0,sizeof(ans));
32         num=0;
33         for(int i=1;i<=m;++i)
34             scanf("%d%c%d",&a[i].x,&a[i].c,&a[i].y);
35         for(int i=0;i<n;++i){
36             bool flag=true;
37             for(int j=0;j<n;++j)
38                 root[j]=j,f[j]=0;
39             for(int j=1;j<=m;++j){
40                 if(a[j].x!=i&&a[j].y!=i){
41                     int t1=a[j].x,t2=a[j].y,t3,r1,r2;
42                     if(a[j].c=='<') t3=-1;
43                     else if(a[j].c=='=') t3=0;
44                     else t3=1;
45                     r1=getr(t1),r2=getr(t2);
46                     if(r1==r2){
47                         if(f[t1]!=(t3+f[t2]+4)%3-1){
48                             ans[i]=j;
49                             flag=false;
50                             break;
51                         }
52                     }
53                     else{
54                         root[r2]=r1;
55                         f[r2]=(-((t3+f[t2]+4)%3-1)+f[t1]+4)%3-1;
56                     }
57                 }
58             }
59             if(flag)
60                 ++num,res=i;
61         }
62         if(num<1)
63             printf("Impossible\n");
64         else if(num>1)
65             printf("Can not determine\n");
66         else{
67             int Max=0;
68             for(int i=0;i<n;++i)
69                 if(ans[i]>Max)
70                     Max=ans[i];
71             printf("Player %d can be determined to be the judge after %d lines\n",res,Max);
72         }
73     }
74     return 0;
75 }