#define PROBLEM "https://judge.yosupo.jp/problem/predecessor_problem"
#include <bits/stdc++.h>
using namespace std;
#include "../../segtree/segtree.hpp"
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
typedef pair<int,int> pii;
#define all(v) (v).begin(),(v).end()
#define db(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<'\n'
const char en = '\n';
const int inf = 1e9+7;
const int N = 1e6+9;
int op(int a, int b) { return a | b; }
int e() { return 0; }
int f(int a) {
return !a;
}
int main() {
ios_base::sync_with_stdio(0);
int n, q;
string s;
cin>>n>>q>>s;
vector<int> v(n);
for(int i=0;i<n;++i)
if(s[i]=='1') v[i] = 1;
SegmentTree<int, op, e> seg(v);
while(q--) {
int typ, k;
cin>>typ>>k;
if(typ==0) {
if(!seg.get(k))
seg.set(k, 1);
} else if(typ==1) {
if(seg.get(k))
seg.set(k, 0);
} else if(typ==2) {
if(seg.get(k))
cout<<"1\n";
else cout<<"0\n";
} else if(typ==3) {
int res = seg.max_right(k, f);
if(res==n) res = -1;
cout<<res<<en;
} else if(typ==4) {
int res = seg.min_left(k+1, f);
--res;
cout<<res<<en;
}
}
return 0;
}
#line 1 "library/test/yosupo/predecessor_problem.segtree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/predecessor_problem"
#include <bits/stdc++.h>
using namespace std;
#line 2 "library/segtree/segtree.hpp"
template <class S, S (*op)(S, S), S (*e)()>
struct SegmentTree {
private:
int _n, size, log;
vector<S> dat;
void update(int k) { dat[k] = op(dat[2 * k], dat[2 * k + 1]); }
public:
SegmentTree() : SegmentTree(0) {}
SegmentTree(int n) : SegmentTree(vector<S>(n, e())) {}
SegmentTree(const vector<S>& v) : _n(int(v.size())) {
log = 0;
while ((1 << log) < _n) log++;
size = 1 << log;
dat = vector<S>(2 * size, e());
for (int i = 0; i < _n; i++) dat[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
// a[p] = x
void set(int p, S x) {
p += size;
dat[p] = x;
for (int i = 1; i <= log; i++) update(p >> i);
}
// return a[p]
S get(int p) const { return dat[p + size]; }
// return op(a[l], ..., a[r-1]), return e() if l = r
S prod(int l, int r) const {
S sml = e(), smr = e();
l += size;
r += size;
while (l < r) {
if (l & 1) sml = op(sml, dat[l++]);
if (r & 1) smr = op(dat[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
// return op(a[l], ..., a[r-1]), return e() if n = 0
S all_prod() const { return dat[1]; }
// Binary search on SegmentTree (if needed)
// return r, f(op(a[l], ..., a[r-1])) == true
template <bool (*f)(S)>
int max_right(int l) const {
return max_right(l, [](S x) { return f(x); });
}
template <class F>
int max_right(int l, F f) const {
assert(f(e()));
if (l == _n) return _n;
l += size;
S sm = e();
do {
while (l % 2 == 0) l >>= 1;
if (!f(op(sm, dat[l]))) {
while (l < size) {
l = (2 * l);
if (f(op(sm, dat[l]))) {
sm = op(sm, dat[l]);
l++;
}
}
return l - size;
}
sm = op(sm, dat[l]);
l++;
} while ((l & -l) != l);
return _n;
}
// return l, f(op(a[l], ..., a[r-1])) == true
template <bool (*f)(S)>
int min_left(int r) const {
return min_left(r, [](S x) { return f(x); });
}
template <class F>
int min_left(int r, F f) const {
assert(f(e()));
if (r == 0) return 0;
r += size;
S sm = e();
do {
r--;
while (r > 1 && (r % 2)) r >>= 1;
if (!f(op(dat[r], sm))) {
while (r < size) {
r = (2 * r + 1);
if (f(op(dat[r], sm))) {
sm = op(dat[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(dat[r], sm);
} while ((r & -r) != r);
return 0;
}
}; // SegmentTree
#line 5 "library/test/yosupo/predecessor_problem.segtree.test.cpp"
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
typedef pair<int,int> pii;
#define all(v) (v).begin(),(v).end()
#define db(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<'\n'
const char en = '\n';
const int inf = 1e9+7;
const int N = 1e6+9;
int op(int a, int b) { return a | b; }
int e() { return 0; }
int f(int a) {
return !a;
}
int main() {
ios_base::sync_with_stdio(0);
int n, q;
string s;
cin>>n>>q>>s;
vector<int> v(n);
for(int i=0;i<n;++i)
if(s[i]=='1') v[i] = 1;
SegmentTree<int, op, e> seg(v);
while(q--) {
int typ, k;
cin>>typ>>k;
if(typ==0) {
if(!seg.get(k))
seg.set(k, 1);
} else if(typ==1) {
if(seg.get(k))
seg.set(k, 0);
} else if(typ==2) {
if(seg.get(k))
cout<<"1\n";
else cout<<"0\n";
} else if(typ==3) {
int res = seg.max_right(k, f);
if(res==n) res = -1;
cout<<res<<en;
} else if(typ==4) {
int res = seg.min_left(k+1, f);
--res;
cout<<res<<en;
}
}
return 0;
}
library/test/yosupo/predecessor_problem.segtree.test.cpp