#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T read1() {
  T t = 0;
  bool ty = 0;
  char k;
  do k = getchar(), (k == '-') && (ty = 1);
  while ('0' > k || k > '9');
  do t = (t << 3) + (t << 1) + (k ^ '0'), k = getchar();
  while ('0' <= k && k <= '9');
  return ty ? -t : t;
}
long long El(long long n) {
  long long tn = n;
  for (long long i = 2; i * i <= n; ++i)
    if (!(n % i)) {
      tn = tn / i * (i - 1);
      while (!(n % i)) n /= i;
    }
  if (n ^ 1) tn = tn / n * (n - 1);
  return tn;
}
long long Ge(long long n, long long m) { return n > m ? n % m + m : n; }
template <typename T>
T qkpow(T k, const long long n, long long Mod) {
  if (n == 1) return k;
  T tem = qkpow(k, n >> 1, Mod);
  if (Mod != 0) {
    tem = Ge(tem * tem, Mod);
    if (n & 1) tem = Ge(tem * k, Mod);
  } else {
    tem *= tem;
    if (n & 1) tem *= k;
  }
  return tem;
}
long long s, m, a[100001], phi[100001], l, r, tot;
long long que(long long n, long long mo) {
  if (n == r || mo == 1) return Ge(a[n], mo);
  return qkpow(a[n], que(n + 1, phi[n - l + 1]), mo);
}
signed main() {
  s = read1<long long>();
  phi[0] = read1<long long>();
  while (phi[tot] != 1) phi[tot + 1] = El(phi[tot]), ++tot;
  for (long long i = 0; i++ ^ s;) a[i] = read1<long long>();
  for (long long T = read1<long long>(); T--;) {
    l = read1<long long>(), r = read1<long long>();
    printf("%lld\n", que(l, phi[0]) % phi[0]);
  }
  return 0;
}
