#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int val[N], mo[N], tl, is;
inline long long qpow(long long x, int y, int mod) {
  long long ret = 1;
  while (y) {
    if (y & 1) {
      ret *= x;
      if (ret >= mod) is = 1, ret = ret % mod + mod;
    }
    x *= x;
    if (x >= mod) is = 1, x = x % mod + mod;
    y >>= 1;
  }
  return ret;
}
int calc(int l, int r, int pos) {
  if (mo[pos] == 1) return 1;
  if (l == r) {
    if (val[l] >= mo[pos]) return val[l] % mo[pos] + mo[pos];
    return val[l];
  }
  return qpow(val[l], calc(l + 1, r, pos + 1), mo[pos]);
}
int main() {
  int n, p, q, i;
  scanf("%d%d", &n, &p);
  for (i = 1; i <= n; i++) scanf("%d", &val[i]);
  mo[++tl] = p;
  while (p != 1) {
    int tmp = p, phi = p;
    for (i = 2; i * i <= p; i++) {
      if (tmp == 1) break;
      if (!(tmp % i)) {
        phi = phi / i * (i - 1);
        while (!(tmp % i)) tmp /= i;
      }
    }
    if (tmp != 1) phi = phi / tmp * (tmp - 1);
    mo[++tl] = phi;
    p = phi;
  }
  scanf("%d", &q);
  for (i = 1; i <= q; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    is = 0;
    printf("%d\n", calc(l, r, 1) % mo[1]);
  }
  return 0;
}
