#include "prg.h"

#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e3+5,M=2e5+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=2e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int qry(int x,int y,int op){
	if(op==0) return x&y;
	if(op==1) return x|y;
	return x^y;
}
pii calc(vector<int> op){
	int c0=0,c1=0;
	int k=op.size()+1;
	for(int i=0;i<(1<<k);i++){
		int w=i&1;
		for(int j=1;j<k;j++) w=qry(w,i>>j&1,op[j-1]);
		(w?c1:c0)++;
	}
	return make_pair(c0,c1);
}
int solve(int n,int m,int k,vector<int> op,array<vector<int>,3000> x,int c,array<array<int,3000>,25> s){
	db p=-log(1.0/2)*m*c;
	auto [t0,t1]=calc(op);
	if(t0^t1){
		for(int i=0;i<c;i++){
			for(int j=0;j<m;j++){
				p+=log((s[i][j]?t1:t0)*1.0/(t0+t1));
			}
		}
	}else{
		op.pop_back();
		auto [t0,t1]=calc(op);
		// gdb(t0,t1);
		if(t0^t1){
			for(int i=0;i<c;i++){
				static int cnt[N][2];
				Me(cnt,0);
				for(int j=0;j<m;j++) cnt[x[j].back()][s[i][j]]++;
				for(int j=0;j<n;j++){
					db w=pow(t0*1.0/(t0+t1),cnt[j][0])*pow(t1*1.0/(t0+t1),cnt[j][1]);
					w+=pow(t0*1.0/(t0+t1),cnt[j][1])*pow(t1*1.0/(t0+t1),cnt[j][0]);
					p+=log(w*0.5);
				}
			}
		}else{
			op.pop_back();
			if(op[0]==1){
				for(int i=0;i<c;i++) for(int j=0;j<m;j++) s[i][j]^=1;
			}
			static vector<tuple<int,int,int> > S[N];
			p=0;
			int cts=0;
			for(int i=0;i<c;i++){
				for(int j=0;j<n;j++) S[j].clear();
				for(int j=0;j<m;j++){
					int a=x[j][2],b=x[j][3];
					S[a].emplace_back(b,s[i][j],j);
					S[b].emplace_back(a,s[i][j],j);
				}
				for(int j=0;j<n;j++){
					sort(all(S[j]));
					reverse(all(S[j]));
				}
				for(int j=0;j<n;j++){
					for(auto [a1,b1,c1]:S[j]){
						if(a1<j) break;
						for(auto [a2,b2,c2]:S[a1]) if(c2^c1){
							if(a2<j) break;
							if(a2==j) p+=log((b1^b2?6:10)/16.0)-log(1/2.0);
							for(auto [a3,b3,c3]:S[a2]) if(c3^c1&&c3^c2){
								if(a3<a1) break;
								if(a3==j) p+=log((b1^b2^b3?28:36)/64.0)-log(1/2.0);
								for(auto [a4,b4,c4]:S[a3]) if(c4^c3&&c4^c2&&c4^c1){
									if(a4<j) break;
									if(a4==j) p+=log((b1^b2^b3^b4?120:136)/256.0)-log(1/2.0);
									cts++;
								}
							}
						}
					}
				}
			}
			gdb(cts);
			/*auto [t0,t1]=calc(op);
			gdb(t0,t1);
			for(int i=0;i<c;i++){
				map<pii,array<int,2> > f;
				for(int j=0;j<m;j++){
					int a=x[j][2],b=x[j][3];
					if(a>b) swap(a,b);
					f[make_pair(a,b)][s[i][j]]++;
				}
				for(auto [a,b]:f){
					db w=pow(t0*1.0/(t0+t1),b[0])*pow(t1*1.0/(t0+t1),b[1]);
					w+=pow(t0*1.0/(t0+t1),b[1])*pow(t1*1.0/(t0+t1),b[0]);
					p+=log(w*0.5);
				}
			}*/
		}
	}
	return p>0?2:1;
}
// i=prg;g++ -o $i grader.cpp $i.cpp -std=c++17 -DLOCAL -O2&& ./$i < 1.in