#include <iostream>
#include <fstream>
#include <vector>
#include <string>
using namespace std;

int main() {
    ifstream inp("bros.in");
    ofstream out("bros.out");

    string s;
    inp >> s;
    int n = s.size();

    int Q;
    inp >> Q;

    vector<int> startL(n + 1, 0), startR(n + 1, 0);
    vector<long long> A(n + 1, 0), startA(n + 1, 0);

    for (int i = 1; i <= n; i++) {
        startL[i] = startL[i - 1] + (s[i - 1] == 'L');
        startR[i] = startR[i - 1] + (s[i - 1] == 'R');
        A[i] = (s[i - 1] == 'R' ? startL[i] : 0);
        startA[i] = startA[i - 1] + A[i];
    }

    while (Q--) {
        int l, r;
        inp >> l >> r;

        int countR = startR[r] - startR[l - 1];
        int countL = startL[r] - startL[l - 1];
        long long sumR = (startA[r] - startA[l - 1]) - (long long)(startR[r] - startR[l - 1]) * startL[l - 1];

        long long result = (long long)countR * countL - sumR;
        out << result << "\n";
    }

    return 0;
}