#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,sse3")
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>

using namespace std;
typedef long long ll;

#define endl '\n'
ll n, m;

string simulation(string a, ll p){
    a[p] = 'R';
    while(p >= 1 && p <= n){
        if(a[p] == 'R'){
            a[p] = 'B';
            p++;
        }
        else{
            a[p] = 'R';
            p--;
        }
    }
    
    return a;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n >> m;
    
    string a;
    cin >> a;
    
    for(auto &i: a)
        i = (i == 'R' ? '>' : '<');
    a = "#" + a;
    
    vector<ll> d(m + 1);
    for(int i = 1; i <= m; i++)
        cin >> d[i];
    
    ll q;
    cin >> q;
    
    auto a0 = a;
    while(q--){
        ll l, r;
        cin >> l >> r;
        
        a = a0;
        
        for(int i = l; i <= r; i++){
            ll left0 = 0, right = 0;
            
            ll p = d[i];
            
            for(int j = 1; j < p; j++)
                if(a[j] == '>')
                    left0++;
            
            for(int j = p + 1; j <= n; j++)
                if(a[j] == '<')
                    right++;
                        
            if(left0 >= right){
                // sufix to '<'
                
                ll need = right;
                ll cur = p;
                
                for(int j = p - 1; j >= 1 && need > 0; j--){
                    if(a[j] == '>'){
                        need--;
                        cur = j;
                    }
                }
                
                for(int j = cur; j <= n; j++)
                    a[j] = '<';
            }
            else{
                // prefix to '>'
                
                ll need = left0 + 1;
                ll cur = p;
                
                for(int j = p + 1; j <= n && need > 0; j++){
                    if(a[j] == '<'){
                        need--;
                        cur = j;
                    }
                }
                
                for(int j = 1; j <= cur; j++)
                    a[j] = '>';
            }
        }
        
        ll ans = 0;
        
        for(int i = 1; i <= n; i++)
            ans += (a[i] == '>');
        
        cout << ans << endl;
    }
    
    return 0;
}
/*
 5 3
 RBRBR
 1 3 4
 1
 2 3
 
 */