#include<bits/stdc++.h>
using namespace std;
template <typename T>inline void read(T &x)
{
    x=0;char c=getchar();bool f=0;
    for(;c<'0'||c>'9';c=getchar())f|=(c=='-');
    for(;c>='0'&&c<='9';c=getchar())x=(x<<1)+(x<<3)+(c-'0');
    x=(f?-x:x);
}
const int N = 2e6+7;
int n,m,C=0;
char s[N];
int a[2][N];
typedef long long LL;
LL Sum=0;
LL tag[N*4],mx[N*4],d1[N],d2[N];
void build(int k,int l,int r)
{
    if(l==r)
    {
        if(l)d1[l]+=d1[l-1];
        if(l)d2[l]+=d2[l-1];
        LL x=C-l;
        mx[k]=-1ll*l*(l+1)/2-1ll*x*(x+1)/2+d1[l]+d2[l]*l-l;
        //cout<<mx[k]<<' '<<l<<endl;
        return;
    }
    int mid=(l+r)>>1;
    build(k<<1,l,mid);
    build(k<<1|1,mid+1,r);
    mx[k]=min(mx[k<<1],mx[k<<1|1]);
}
void pushtag(int k,LL v)
{
    tag[k]+=v;
    mx[k]+=v;
}
void pushdown(int k)
{
    if(tag[k])
    {
        pushtag(k<<1,tag[k]);
        pushtag(k<<1|1,tag[k]);
        tag[k]=0;
    }
}
void modify(int k,int l,int r,int L,int R,LL v)
{
    if(L>R)return;
    if(L<=l&&r<=R)
    {
        pushtag(k,v);
        return;
    }
    pushdown(k);
    int mid=(l+r)>>1;
    if(L<=mid)modify(k<<1,l,mid,L,R,v);
    if(R>mid)modify(k<<1|1,mid+1,r,L,R,v);
    mx[k]=min(mx[k<<1],mx[k<<1|1]);
}
LL qry(int k,int l,int r,int L,int R)
{
    //if(k==1)cout<<L<<' '<<R<<endl;
    if(L<=l&&r<=R)return mx[k];
    pushdown(k);
    LL res=1e18;
    int mid=(l+r)>>1;
    if(L<=mid)res=min(res,qry(k<<1,l,mid,L,R));
    if(R>mid)res=min(res,qry(k<<1|1,mid+1,r,L,R));
    return res;
}
LL pre[N],cur=0;
void calc()
{
    //cout<<Sum<<endl;
    LL ans=qry(1,0,C,max(0,C-n),min(C/2ll,cur));
    printf("%lld\n",ans+cur+Sum);
}
int main()
{
    //freopen("a.in","r",stdin);
    //freopen("a.ans","w",stdout);
    //freopen("ex_b4.in","r",stdin);
    read(n);read(m);
    for(int c=0;c<=1;c++)
    {
        scanf("%s",s+1);
        for(int i=1;i<=n;i++)
        {
            a[c][i]=(s[i]=='P'),C+=a[c][i];
            pre[i]+=a[c][i];
            Sum+=a[c][i]*i;
            if(c==1)cur+=a[c][i];
        }
    }
    //cout<<Sum<<endl;
    for(int i=1;i<n;i++)
    {
        pre[i]+=pre[i-1];
        LL v=pre[i]-i;
        LL l=0,r=min(v,(LL)C);
        if(l<=r)
        {
            //cout<<l<<' '<<r<<endl;
            d1[l]+=2ll*v;
            d1[r+1]-=2ll*v;
            d2[l]-=2;
            d2[r+1]+=2;
        }
    }
    build(1,0,C);
    calc();
    while(m--)
    {
        int op,x,y;
        read(op);read(x);read(y);
        x--;
        if(op==1)
        {
            if(a[x][y]==a[x][y+1]);
            else
            {
                if(a[x][y]==1)
                {
                    pre[y]--;
                    modify(1,0,C,0,pre[y]-y,-2);
                    Sum++;
                }
                else
                {
                    modify(1,0,C,0,pre[y]-y,2);
                    pre[y]++;
                    Sum--;
                }
                swap(a[x][y],a[x][y+1]);
            }
        }
        else
        {
            if(a[x][y]==a[x+1][y]);
            else
            {
                if(a[x+1][y]==1)cur--;
                else cur++;
            }
            swap(a[x][y],a[x+1][y]);
        }
        calc();
    }
    return 0;
}