#include<bits/stdc++.h>
using namespace std;
mt19937 rnd(time(0));
int n,k,rt,rt1,tot;
char a[300005],b[300005];
struct Node{int son[2],op,key,sz,pos[2];}t[600005];
#define ls(p) t[p].son[0]
#define rs(p) t[p].son[1]
#define op(p) t[p].op
#define key(p) t[p].key
#define sz(p) t[p].sz
void Add(int p,int q,int d){for(int i=0;i<2;++i)if(t[q].pos[i])t[p].pos[i]=t[q].pos[i]+d;}
void pp(int p){
	if(!p)return;
	sz(p)=1;t[p].pos[0]=t[p].pos[1]=0;
	t[p].pos[op(p)]=sz(ls(p))+1;
	if(ls(p))sz(p)+=sz(ls(p)),Add(p,ls(p),0);
	if(rs(p))sz(p)+=sz(rs(p)),Add(p,rs(p),sz(ls(p))+1);
}
int merge(int u,int v){
	if(!u||!v)return (u|v);
	if(key(u)<key(v)){
		rs(u)=merge(rs(u),v),pp(u);
		return u;
	}else{
		ls(v)=merge(u,ls(v)),pp(v);
		return v;
	}
}
void split(int u,int &x,int &y,int c){
	if(!u){x=y=0;return;}
	if(sz(ls(u))+1<=c)x=u,split(rs(u),rs(x),y,c-sz(ls(u))-1);
	else y=u,split(ls(u),x,ls(y),c);pp(u);
}
int Lst(int u,int c){
	int x=u-c+1;
	while(x<=0)x+=n;
	while(x>n)x-=n;
	return x;
}
int Nxt(int u,int c){
	int x=u+c-1;
	while(x<=0)x+=n;
	while(x>n)x-=n;
	return x;
}
int len[10],tt,fl;
void opr(int p,int q){
	if(!fl)printf("%d %d\n",p,q);else printf("%d %d\n",q,p);
	int a,b,c,d;split(rt,a,b,p-1),rt=merge(b,a),split(rt1,c,d,q-1),rt1=merge(d,c);
	a=b=c=d=0,split(rt,a,b,k),split(rt1,c,d,k),swap(a,c),rt=merge(a,b),rt1=merge(c,d);
	split(rt,a,b,n-p+1),rt=merge(b,a),split(rt1,c,d,n-q+1),rt1=merge(d,c);
}
int main(){
	scanf("%d%d%s%s",&n,&k,a+1,b+1);int ct=0;
	for(int i=1;i<=n;++i)ct+=(a[i]=='B');
	if(ct<n-ct)swap(a,b),ct=n-ct,fl=1;
	printf("%d\n",((k==1)?1:2)*(n-ct)),ct=n-ct;
	for(int i=1;i<=n;++i){
		++tot;key(tot)=rnd(),sz(tot)=1,op(tot)=(int)(a[i]-'B');
		t[tot].pos[(int)(a[i]-'B')]=1,rt=merge(rt,tot);
		++tot;key(tot)=rnd(),sz(tot)=1,op(tot)=(int)(b[i]-'B');
		t[tot].pos[(int)(b[i]-'B')]=1,rt1=merge(rt1,tot);
	}
	while(ct--){
		int s1=t[rt].pos[1],s0=t[rt1].pos[0];
		if(k==1){opr(s1,s0);continue;}
		opr(s1,Lst(s0,k+1)),opr(s1,Lst(s0,k));
	}
	return 0;
}