#include <bits/stdc++.h> using namespace std; const int N=110; int n,c,a[N],t; struct List { bool b[N]; void setup() { for (int i=0;i<N;i++) b[i]=1; } void f(int t) { if (t==1) for (int i=1;i<=n;i++) b[i]=!b[i]; if (t==2) for (int i=1;i<=n;i+=2) b[i]=!b[i]; if (t==3) for (int i=2;i<=n;i+=2) b[i]=!b[i]; if (t==4) for (int i=1;i<=n;i+=3) b[i]=!b[i]; } bool operator < (const List&c) > const { for (int i=1;i<=n;i++) { if ((!b[i])&&o.b[i]) return true; if (b[i]&&(!o.b[i])) return false; } } bool check() { for (int i=1;i<=n;i++) { if (b[i]!=a[i]&&a[i]!=1) return false; } return true; } void output() { for (int i=1;i<=n;i++) { cout<<b[i]; } cout<<endl; } }ls[10]; int main() { cin>>n>>c; for (int i=0;i<N;i++) a[i]=2; while (cin>>t&&t!=-1) a[t]=1; while (cin>>t&&t!=-1) a[t]=0; int idx=0; if (c==0) { ls[idx] } }