#include<bits/stdc++.h>

#define re register
#define ll long long
#define le inline
#define debug printf("\n\n------------This Step Is Ok!------------\n\n");

using namespace std;

inline int read()
{
	int x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-')
            f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
    {
        x=(x<<3)+(x<<1)+(c^48);
		c=getchar();
	}
	return x*f;
}

const int NUM = 2e5+5;
char c[NUM];
int tree[NUM*4];
int lazy[NUM*4],n,m,op,a,b;

inline void pushup(int u)
{
	tree[u] = tree[u*2]+tree[u*2+1];
}

inline bool check1(int R,int L,int r,int l)
{
	return (R <= r) && (L >= l);
}

inline void build(int u,int L,int R)
{
	if(L == R)
	{
		tree[u] = c[L]-'0';
		return;
	}
	int mid=(L+R)>>1;
	build(u*2,L,mid);
	build(u*2+1,mid+1,R);
	pushup(u);
}

inline void change(int u,int len)
{
	lazy[u] ^= 1;
	tree[u] = len-tree[u];
}

inline void pushdown(int u,int L,int R)
{
	if(!lazy[u])
		return;
	int mid = (L+R)>>1;
	change(u*2,L-mid+1);
	change(u*2+1,R-mid);
	lazy[u] = 0;
}

inline void update(int u,int L,int R,int l,int r)
{
	if(check1(L,R,l,r))
		change(u,R-L+1);
	else{
		int mid=(L+R)>>1;
		pushdown(u,L,R);
		if(L <= mid)
			update(u*2,L,mid,l,r);
		if(mid < R)
			update(u*2+1,mid+1,R,l,r);
		pushup(u);
	}
}

inline ll query(int u,int L,int R,int l,int r)
{
	if(check1(L,R,l,r))
		return tree[u];
	else{
		int mid=(L+R)>>1;
		pushdown(u,L,R);
		ll ans=0;
		if(L <= mid)
			ans += query(u*2,L,mid,l,r);
		if(mid < R)
			ans += query(u*2+1,mid+1,R,l,r);
		return ans;
	}
}

int main()
{
	n = read();
	m = read();
	for(re int i = 1;i <= n;++i)
		cin>>c[i];
	build(1,1,n);
	while(m--)
	{
		op = read();
		a = read();
		b = read();
		if(op == 0)
			update(1,1,n,a,b);
		else{
			if(op == 1)
				printf("%lld\n",query(1,1,n,a,b));
		}
	}
	return 0;
}