#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 50, M = 105;
long long n, m, q, w[N], pn, ps[M];
long long phi(long long x) {
  long long res = 1;
  for (long long i = 2; i * i <= x; ++i)
    if (x % i == 0) {
      res *= i - 1;
      x /= i;
      for (; x % i == 0; x /= i) res *= i;
    }
  if (x > 1) res *= x - 1;
  return res;
}
long long pw(long long a, long long k, long long p) {
  long long res = 1;
  for (; k; a = (a * a < p ? a * a : (a * a % p + p)), k >>= 1) {
    if (k & 1) res = (res * a < p ? res * a : (res * a % p + p));
  }
  return res;
}
long long sol(long long l, long long r, long long pos) {
  if (l == r)
    return (w[l] < ps[pos] ? w[l] : (w[l] % ps[pos] + ps[pos]));
  else if (ps[pos] == 1)
    return 1;
  return pw(w[l], sol(l + 1, r, pos + 1), ps[pos]);
}
int main(int argc, char *argv[]) {
  scanf("%lld%lld", &n, &m);
  for (ps[++pn] = m; ps[pn] != 1; ++pn) ps[pn + 1] = phi(ps[pn]);
  for (long long i = 1; i <= (n); ++i) scanf("%lld", w + i);
  scanf("%lld", &q);
  ;
  while (q--) {
    long long l, r;
    scanf("%lld%lld", &l, &r);
    ;
    printf("%lld\n", sol(l, r, 1) % m);
  }
}
