import java.util.Scanner;
public class coin {
static int[] less=new int[1010],more=new int[1010],p=new int[510],q=new int[510],Ans=new int[1010],isTrue=new int[1010];
public static void main(String[] args) {
int N,M;
Scanner scan=new Scanner(System.in);
N=scan.nextInt();
M=scan.nextInt();
for(int i=0;i<1010;i++){
isTrue[i]=0;
Ans[i]=0;
}
for(int i=0;i<510;i++){
p[i]=0;q[i]=0;
}
int k=0;
for(int i=1;i<=M;++i){
int x;
x=scan.nextInt();
for(int j=1;j<=x;++j){
p[j]=scan.nextInt();
}
for(int j=1;j<=x;++j){
q[j]=scan.nextInt();
}
char[] str=new char[10];
str[0]=scan.next().charAt(0);
switch (str[0]){
case '=':
for(int j=1;j<=x;++j){
isTrue[p[j]]=1;
isTrue[q[j]]=1;
}
break;
case '<':++k;
for(int j=1;j<=x;++j){
++less[p[j]];++more[q[j]];
}
break;
case '>':++k;
for(int j=1;j<=x;++j){
++more[p[j]];++less[q[j]];
}
break;
}
}
// 当轻和重部分都出现时则为真币，均未出现时为真，假币在轻重部分出现次数小于轻重比较次数为真
for (int i=1;i<=N;++i){
if(less[i]+more[i]<k || (less[i]!=0 && more[i]!=0)){
isTrue[i]=1;
}
}
// 获取假币下标
int tot=0;
for (int i=1;i<=N;++i){
System.out.println(isTrue[i]);
if(isTrue[i]==0){
Ans[++tot]=i;
}
}
System.out.println(Ans[1]);
System.out.println(tot==1?Ans[1]:0);
}
}
