#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
const int maxn = 300001;
struct node {
  int sz, in0, in1;
};
node tree[maxn];
int n, mod, x, y, a[maxn], b[maxn];
int ret[maxn];
int fibo[maxn];
int cnt, cnts[maxn];
pair<pair<int, int>, pair<int, int> > q[maxn];
int B;
int m;
inline void update(int k) {
  int L = k << 1;
  int R = k << 1 | 1;
  tree[k].sz = tree[L].sz + tree[R].sz;
  tree[k].in0 = (tree[L].in0 + fibo[tree[L].sz + 1] * tree[R].in1 +
                 fibo[tree[L].sz] * tree[R].in0) %
                mod;
  tree[k].in1 = (tree[L].in1 + fibo[tree[L].sz + 2] * tree[R].in1 +
                 fibo[tree[L].sz + 1] * tree[R].in0) %
                mod;
}
void insert(int k, int l, int r, int x, int p) {
  if (l == r) {
    tree[k].sz = p;
    tree[k].in0 = 0;
    tree[k].in1 = (p == 0) ? 0 : (b[x] % mod);
    return;
  }
  int mid = (l + r) >> 1;
  if (x <= mid)
    insert(k << 1, l, mid, x, p);
  else
    insert(k << 1 | 1, mid + 1, r, x, p);
  update(k);
}
inline void add(int p) {
  if (++cnts[a[p]] == 1) insert(1, 0, cnt - 1, a[p], 1);
}
inline void del(int p) {
  if (--cnts[a[p]] == 0) insert(1, 0, cnt - 1, a[p], 0);
}
int main() {
  scanf("%d%d", &n, &mod);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    b[i - 1] = a[i];
  }
  fibo[0] = 1;
  fibo[2] = 1;
  for (int i = 3; i <= n + 20; i++) fibo[i] = (fibo[i - 2] + fibo[i - 1]) % mod;
  sort(b, b + n);
  B = sqrt(n);
  cnt = unique(b, b + n) - b;
  for (int i = 1; i <= n; i++) a[i] = lower_bound(b, b + cnt, a[i]) - b;
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &x, &y);
    q[i] = pair<pair<int, int>, pair<int, int> >(pair<int, int>(x, y),
                                                 pair<int, int>(x / B, i));
  }
  sort(q + 1, q + 1 + m,
       [](pair<pair<int, int>, pair<int, int> > &x,
          pair<pair<int, int>, pair<int, int> > &y) {
         if (x.second.first != y.second.first)
           return x.second.first < y.second.first;
         return x.first.second < y.first.second;
       });
  int l = 1;
  int r = 0;
  for (int i = 1; i <= m; i++) {
    while (r < q[i].first.second) add(++r);
    while (r > q[i].first.second) del(r--);
    while (l > q[i].first.first) add(--l);
    while (l < q[i].first.first) del(l++);
    ret[q[i].second.second] = tree[1].in1 % mod;
  }
  for (int i = 1; i <= m; i++) printf("%d\n", ret[i]);
}
