#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}
#include <atcoder/segtree>
using F = array<array<ll, 4>, 4>;
F op(F l, F r){
    F res;
    rep(i, 0, 4) rep(j, 0, 4){
        res[i][j] = 0;
    }
    rep(i, 0, 4) rep(j, 0, 4) rep(k, 0, 4){
        res[i][k] += l[i][j] * r[j][k];
    }
    return res;
}
F e(){
    F res;
    rep(i, 0, 4) rep(j, 0, 4) res[i][j] = (i == j ? 1 : 0);
    return res;
}

void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, Q;
    cin >> N >> Q;
    string X;
    cin >> X;
    int H = N / 2;
    vector<F> base(H);
    rep(rp, 0, H){
        char c = X[rp * 2 + 1];
        bool t = (X[rp * 2 + 2] == 'T');
        F res;
        rep(i, 0, 4) rep(j, 0, 4) res[i][j] = 0;
        res[3][3] = 1;
        res[2][2] = 1;
        if (t) res[2][3] = 1, res[2][1] = 1;
        else res[2][0] = 1;
        rep(i, 0, 2){
            bool ok = false;
            if (c == '+') ok = (i == 1 || t);
            if (c == '*') ok = (i == 1 && t);
            if (c == '^') ok = ((i == 1) ^ t);
            if (ok) res[i][3] = 1, res[i][1] = 1;
            else res[i][0] = 1;
        }
        base[rp] = res;
    }
    atcoder::segtree<F, op, e> seg(base);
    while (Q--){
        int l, r;
        cin >> l >> r;
        l--;
        auto tmp = seg.prod(l / 2, r / 2);
        ll ans = tmp[2][3];
        if (X[l] == 'T') ans += 1 + tmp[1][3];
        else ans += tmp[0][3];
        cout << ans << "\n";
    }
}