#include <bits/stdc++.h>

// #define int int64_t

const int kMaxN = 1.2e5 + 5;

int n, m, q;
int a[kMaxN];
std::string str;

void update(std::string &s, int p) {
  if (p < 1 || p > n) return;
  if (s[p] == 'R') {
    s[p] = 'L', update(s, p + 1);
  } else {
    s[p] = 'R', update(s, p - 1);
  }
}

int solve(int l, int r) {
  std::string s = str;
  for (int i = l; i <= r; ++i) {
    s[a[i]] = 'R';
    update(s, a[i]);
  }
  return std::count(s.begin(), s.end(), 'R');
}

void dickdreamer() {
  std::cin >> n >> m >> str;
  for (auto c : str)
    if (c == 'B')
      c = 'L';
  str = " " + str;
  for (int i = 1; i <= m; ++i) std::cin >> a[i];
  std::cin >> q;
  for (int i = 1; i <= q; ++i) {
    int l, r;
    std::cin >> l >> r;
    std::cout << solve(l, r) << '\n';
  }
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (T--) dickdreamer();
  // std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}