#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <deque>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <bitset>
#include <vector>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define p(i,j) make_pair(i,j)
#define DEBUG_CODE 1
#define dc DEBUG_CODE
#define DB if(DEBUG_CODE)
#define DBC if(DEBUG_CODE) cout<<
#define NDB if(!DEBUG_CODE)
#define DB2 if(DEBUG_CODE>=2)
#define DBC2 if(DEBUG_CODE>=2) cout<<
#define NDB2 if(!DEBUG_CODE<2)
using namespace std;
int n,m,x,y,z,a[1000010],ans,sum,cnt,tmp,tot,k,T,l,r,now;
bitset<10000000> bs,tmpp;
string s;
int main(){
	NDB{
		std::ios::sync_with_stdio(0);
		cin.tie(0);
	}
	cin>>n>>T;
	while(T--){
		int opt;
		cin>>opt;
		if(opt==1){
			cin>>x>>y;
			if(x>=n) cout<<-1<<"\n";
			bs.set(x,y);
		}else if(opt==2){
			cin>>x;
			if(x>=n) cout<<-1<<"\n";
			bs.flip(x);
		}else if(opt==3){
			cin>>x;
			if(x>=n) cout<<-1<<"\n";
			else cout<<bs.test(x)<<"\n";
		}else if(opt==4){
			cin>>s;
			tmpp=bitset<10000000>(s);
			bs&=tmpp;
		}else if(opt==5){
			cin>>s;
			tmpp=bitset<10000000>(s);
			bs|=tmpp;
		}else if(opt==6){
			cin>>s;
			tmpp=bitset<10000000>(s);
			bs^=tmpp;
		}else{
			cout<<bs.count()<<"\n"; 
		}
	}
	for(int i=0;i<n;i++) cout<<bs[i];
	return 0;
}

/*



*/





0 comments

No comments so far...