#include<iostream>
#include<cstring>
#include<vector>
#include<deque>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n, k;
    cin >> n >> k;
    vector<int> a(n), b(n);
    for(int i = 0; i < n; i++){
        char c;
        cin >> c;
        a[i] = (c == 'B');
    }
    for(int i = 0; i < n; i++){
        char c;
        cin >> c;
        b[i] = (c == 'B');
    }
    int c1 = 0, c2 = 0;
    int cnt = count(a.begin(), a.end(), 1);
    if (cnt * 2 >= n){
        c1 = 1;
        c2 = 0;
    }
    else{
        c1 = 0;
        c2 = 1;
        cnt = n - cnt;
    }
    vector<pair<int, int> > ans;
    deque<int> q1(a.begin(), a.begin() + k);
    deque<int> q2(b.begin(), b.begin() + k);

    int p1 = 0, p2 = 0;
    auto swp = [&](){
        ans.push_back({p1, p2});
        q1.swap(q2);
        a[p1] = q1.front();
        q1.pop_front();
        q1.push_back(a[(p1 + k) % n]);
        p1 = (p1 + 1) % n;
        ans.push_back({p1, p2});
        q1.swap(q2);
    };
    
    for(int i = 0; i < n - cnt; i++){
        while(a[(p1 + k) % n] == c1){
            a[p1] = q1.front();
            q1.pop_front();
            q1.push_back(a[(p1 + k) % n]);
            p1 = (p1 + 1) % n;
        }
        while(q2.front() == c2){
            b[p2] = q2.front();
            q2.pop_front();
            q2.push_back(b[(p2 + k) % n]);
            p2 = (p2 + 1) % n;
        }
        swp();
    }
    cout << ans.size() << '\n';
    for(auto [x, y] : ans){
        cout << x + 1 << ' ' << y + 1 << '\n';
    }

}