#include "prg.h"
#include<bits/stdc++.h>
using namespace std;
int solve(int n,int m,int k,vector<int>op,array<vector<int>,3000>x,int c,array<array<int,3000>,25>s){
	if(k==2){
		int a1=0,a2=0;
		for(int i=0;i<c;++i){
			int h=0;
			for(int j=0;j<m;++j){
				h+=s[i][j];
			}
			if(h>=(m/4+m/2)/2&&h<=(m*3/4+m/2)/2)++a1;
			else ++a2;
		}
		return (a2<=1?1:2);
	}
	if(k>=3&&op[k-2]!=2){
		int a1=0,a2=0;
		for(int i=0;i<c;++i){
			int h=0;
			for(int j=0;j<m;++j){
				h+=s[i][j];
			}
			if(h>=m/2-m/16&&h<=m/2+m/16)++a1;
			else ++a2;
		}
		return (a2<=1?1:2);
	}
	vector<vector<int>>gs(n);
	for(int i=0;i<m;++i){
		gs[x[i][2]].emplace_back(i);
	}
	int mn=0,ms=0;
	for(int i=0;i<n;++i)if((signed)gs[i].size()>=2){
		int t=gs[i].size(),kn=0;
		for(int j=0;j<c;++j){
			int h=0;
			for(auto k:gs[i]){
				h+=s[j][k];
			}
			if(h==0||h==t)++kn;
		}
		mn+=kn;++ms;
	}
	if(1.0*mn/ms>6.1)return 2;
//	assert(0);
	return 1;
}