#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<bitset>
#include<set> 
#define ll long long
#define lowbit(x) x&(-x)
#define mp make_pair
#define rep(i,x,n) for(int i=x;i<=n;i++)
#define per(i,n,x) for(int i=n;i>=x;i--)
#define forE(i,x) for(int i=head[x];i;i=nxt[i])
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int maxn=2e5+5;
const int mod=998244353;
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*10+(c-'0');
		c=getchar();
	}
	return x*f;
}

char c[maxn];

struct SegTree{
	struct node{
		int l,r;
        ll num[2],sum[2],add;
	}t[maxn<<2];
	inline void spread(int p)
	{
		if(t[p].add)
		{
			t[p*2].add^=t[p].add;
			swap(t[p*2].num[0],t[p*2].num[1]);
            swap(t[p*2].sum[0],t[p*2].sum[1]);
            t[p*2+1].add^=t[p].add;
			swap(t[p*2+1].num[0],t[p*2+1].num[1]);
            swap(t[p*2+1].sum[0],t[p*2+1].sum[1]);
			t[p].add=0;
		}
	}
	inline void pushup(int p)
	{
        t[p].sum[0]=t[p*2].sum[0]+t[p*2+1].sum[0];
        t[p].sum[1]=t[p*2].sum[1]+t[p*2+1].sum[1];
        t[p].num[0]=t[p*2].num[0]+t[p*2+1].num[0];
        t[p].num[1]=t[p*2].num[1]+t[p*2+1].num[1];
    }
	inline void build(int p,int l,int r)
	{
		t[p].l=l;t[p].r=r;t[p].add=0,t[p].sum[0]=t[p].sum[1]=t[p].num[0]=t[p].num[1]=0;
		if(l==r)
		{
            int x=c[l]-'0';
            t[p].num[x]++;
            t[p].sum[x]+=l;
			return;
		}
		int mid=(t[p].l+t[p].r)/2;
		build(p*2,l,mid);
		build(p*2+1,mid+1,r);
		pushup(p);
	}
	inline void change(int p,int l,int r)
	{
		if(t[p].l>=l&&t[p].r<=r)
		{
			swap(t[p].num[0],t[p].num[1]);
            swap(t[p].sum[0],t[p].sum[1]);
			t[p].add^=1;
			return;
		}
		spread(p);
		int mid=(t[p].l+t[p].r)/2;
		if(l<=mid) change(p*2,l,r);
		if(r>mid) change(p*2+1,l,r);
		pushup(p);
	}
	inline ll asknum(int p,int l,int r,int v)
	{
        if(l>r) return 0;
		if(t[p].l>=l&&t[p].r<=r)
		{
			return t[p].num[v];
		}
		spread(p);
		int mid=(t[p].l+t[p].r)/2;
		ll res=0;
		if(l<=mid) res+=asknum(p*2,l,r,v);
		if(r>mid) res+=asknum(p*2+1,l,r,v);
		return res;
	}
	inline ll asksum(int p,int l,int r,int v)
	{
        if(l>r) return 0;
		if(t[p].l>=l&&t[p].r<=r)
		{
			return t[p].sum[v];
		}
		spread(p);
		int mid=(t[p].l+t[p].r)/2;
		ll res=0;
		if(l<=mid) res+=asksum(p*2,l,r,v);
		if(r>mid) res+=asksum(p*2+1,l,r,v);
		return res;
	}    
    inline ll get1(int p,int v)
    {
        if(t[p].l==t[p].r) return t[p].l;
        spread(p);
        int mid=(t[p].l+t[p].r)/2;
        if(t[p*2+1].num[1]>=v) return get1(p*2+1,v);
        else return get1(p*2,v-t[p*2+1].num[1]);
    }
    inline ll get0(int p,int v)
    {
        if(t[p].l==t[p].r) return t[p].l;
        spread(p);
        int mid=(t[p].l+t[p].r)/2;
        if(t[p*2].num[0]>=v) return get0(p*2,v);
        else return get0(p*2+1,v-t[p*2].num[0]);
    }
}S; 
int n,q;

signed main()
{
    while(scanf("%d %d",&n,&q) != EOF)
    {
        scanf("%s",c+1);
        S.build(1,1,n);
        rep(i,1,q)
        {
            int p1=read(),p2=read();
            S.change(1,p1,p2);
            int tot = S.asknum(1,1,n,0);
            if(tot==0) {printf("%d\n",n);continue;}
            if(tot==n) {printf("0\n");continue;}  
            int l=1,r=n,res=-1;
            while(l<=r)
            {
                int mid=(l+r)/2;
                int x=S.asknum(1,1,mid,0),y=S.asknum(1,mid+1,n,1);
                if(x<=y) res=mid,l=mid+1;
                else r=mid-1;
            }
            if(S.asknum(1,1,res,0) == 0) {printf("%lld\n",S.asknum(1,1,n,1));continue;}
            ll num=S.asknum(1,1,res,0);
            ll L=S.get0(1,num);
            ll R=S.get1(1,num);
            // printf("3: %lld\n",res);
            ll ans=S.asknum(1,1,L,1);
            // printf("4: %lld %lld %lld\n",num,L,R);
            ans+=(S.asksum(1,R,n,1)-S.asksum(1,1,L,0)+num)*2ll-num;
            printf("%lld\n",ans);
        }
    }
}