#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int Mod = 1e9 + 7;
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 10010;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN], inv[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
	for(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i-1]);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
template<typename T> inline void chmax(T &_a, T _b){ (_a<_b) ? (_a=_b) : 0; }
template<typename T> inline void chmin(T &_a, T _b){ (_b<_a) ? (_a=_b) : 0; }
mt19937_64 rng(58);
inline int myrand(int l, int r){ return (int)(rng() % (r-l+1)) + l; }

int n, k;
int a[300300], b[300300];
int apre[300300], anxt[300300], bpre[300300], bnxt[300300];

int main(){
	//freopen("g.in", "r", stdin);
	//freopen("g.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n >> k;
	{
		string s;
		cin >> s;
		rep(i, n) a[i] = (s[i] == 'C');
	}
	{
		string s;
		cin >> s;
		rep(i, n) b[i] = (s[i] == 'C');
	}

	int c1 = 0;
	rep(i, n) c1 += a[i];
	if(c1 > (n/2)){
		rep(i, n) a[i] ^= 1, b[i] ^= 1;
		c1 = n - c1;
	}

	rep(i, n) apre[i] = bpre[i] = (i + n - 1) % n, anxt[i] = bnxt[i] = (i + 1) % n;

	vector<pii> ans;
	int ap0 = 0, apk = k-1, aid = 0, bp0 = 0, bpk = k-1, bid = 0;
	while(c1--){
		while(a[ap0] != 1) ap0 = anxt[ap0], apk = anxt[apk], aid = (aid + 1) % n;
		while(b[bnxt[bpk]] != 0) bp0 = bnxt[bp0], bpk = bnxt[bpk], bid = (bid + 1) % n;
		ans.push_back(make_pair(aid, bid)), ans.push_back(make_pair(aid, (bid + 1) % n));
		swap(a[ap0], b[bnxt[bpk]]);
		if(k != 1){
			int nap0 = anxt[ap0], napk = ap0;
			anxt[apre[ap0]] = anxt[ap0], apre[anxt[ap0]] = apre[ap0];
			apre[ap0] = apk, anxt[ap0] = anxt[apk];
			apre[anxt[apk]] = ap0, anxt[apk] = ap0;
			ap0 = nap0, apk = napk;
		}
		if(k == n-1){
			bp0 = bpre[bp0], bpk = bpre[bpk];
		} else if(k == 1){
			bpk = bnxt[bpk];
			bnxt[bpre[bp0]] = bpk, bpre[bnxt[bpk]] = bp0;
			bpre[bpk] = bpre[bp0], bnxt[bp0] = bnxt[bpk];
			bnxt[bpk] = bp0, bpre[bp0] = bpk;
			bp0 = bpk;
		} else {
			int nbp0 = bnxt[bpk], nbpk = bpre[bpk];
			bpk = bnxt[bpk];
			bnxt[bpre[bpk]] = bnxt[bpk], bpre[bnxt[bpk]] = bpre[bpk];
			bpre[bpk] = bpre[bp0], bnxt[bpk] = bp0;
			bnxt[bpre[bp0]] = bpk, bpre[bp0] = bpk;
			bp0 = nbp0, bpk = nbpk;
		}

		{
			deque<int> tmpa, tmpb;
			for(int i = ap0, cc = 0; cc < n; i = anxt[i], ++cc)
				assert(apre[anxt[i]] == i), tmpa.push_back(i);
			for(int i = bp0, cc = 0; cc < n; i = bnxt[i], ++cc)
				assert(bpre[bnxt[i]] == i), tmpb.push_back(i);
		}
	}

	cout << (int)ans.size() << "\n";
	rep(i, (int)ans.size()) cout << ans[i].first + 1 << " " << ans[i].second + 1 << "\n";

	return 0;
}