#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
const int  N = 1e6 + 12, MOD = (int)1e9 + 7;

int n, q, d[N], up[N][19], l = 19, up1[N][19], pref[N];
ll c[N][19], c1[N][19];
bool ok[N];
int dist(int v, int u) {
    if(v == u) return 0;
    int ret = 1;
    for(int i = l - 1; i >= 0;i--) {
        if(up[v][i] < u) {
            ret += (1 << i);
            v = up[v][i];
        }
    }
    return ret;
}
string s;
void prec() {
    int it = 1, col = 0;
    for(int i = 1; i <= n + n; i++) {
        char x = s[i - 1];
        if(x == 'R') {
            col--;
            d[it++] = col;
        } else {
            col++;
        }
    }
    for(int i = 0; i < l; i++) {
        up[n][i] = n;
    }
    for(int i = n - 1; i >= 1;i--) {
        int j = i + d[i];
        up[i][0] = j;
        c[i][0] = pref[j];
        for(int k = 1; k < 19; k++) {
            up[i][k] = up[up[i][k - 1]][k - 1];
            c[i][k] = c[i][k - 1] + c[up[i][k - 1]][k - 1];
        }
    }
    for(int i = 0; i < l; i++) {
        up1[1][i] = 1;
    }
    for(int i = 2; i <= n; i++) {
        int j = up1[i - 1][0];
        while(j + d[j] < i) {
            j++;
        }
        up1[i][0] = j;
        c1[i][0] = pref[j - 1];
        for(int k = 1; k < l; k++) {
            up1[i][k] = up1[up1[i][k - 1]][k - 1];
            c1[i][k] = c1[i][k - 1] + c1[up1[i][k - 1]][k - 1];
        }
    }
}
vector<int> sp;
void test() {
    cin >> n >> q >> s;
    for(int i = 1; i <= n; i++) {
        char x;
        cin >> x;
        pref[i] = pref[i - 1];
        if(x == '1') {
            ok[i] = 1;
            pref[i]++;
            sp.push_back(i);
        }
    }
    prec();
    while(q--) {
        int a, b;
        cin >> a >> b;
        int res = dist(a, b);
        ll _ = (ok[a]) + (ok[b]);
        int x = a;
        for(int i = l - 1; i >= 0; i--) {
            if(up[x][i] < b) {
                _ += c[x][i];
                // cout << c[x][i] << '\n';
                x = up[x][i];
            }
        }
        x = b;
        for(int i = l - 1; i >= 0; i--) {
            if(up1[x][i] > a) {
                _ -= c1[x][i];
                x = up1[x][i];
            }
        }
        cout << res << ' ' << _ << '\n';
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); 
    
    int t = 1; 
    // cin >> t;
    
    while(t--) 
        test();
    return 0;
}