#include <bits/stdc++.h>
using namespace std;
const long long N = 500005, M = 20000005;
long long Q, n;
long long a[N], P;
map<long long, long long> mp;
template <typename T>
inline void read(T &x) {
  x = 0;
  char c = getchar(), f = 0;
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') f = 1;
  for (; c >= '0' && c <= '9'; c = getchar())
    x = (x << 1) + (x << 3) + (c ^ 48);
  if (f) x = -x;
}
inline long long FUCK(long long x, long long p) {
  return x < p ? x : (x % p + p);
}
inline long long ksm(long long x, long long q, long long P) {
  long long r = 1;
  for (; q; q >>= 1, x = FUCK(x * x, P))
    if (q & 1) r = FUCK(r * x, P);
  return r;
}
inline long long William(long long x) {
  long long r = x, xx = x;
  if (mp.count(x)) return mp[x];
  for (long long i = 2; i <= sqrt(x); i++)
    if (!(x % i)) {
      r = r / i * (i - 1);
      while (!(x % i)) x /= i;
    }
  if (x > 1)
    return mp[xx] = r / x * (x - 1);
  else
    return mp[xx] = r;
}
inline long long Nephren(long long l, long long r, long long P) {
  if (l == r || P == 1)
    return FUCK(a[l], P);
  else
    return ksm(a[l], Nephren(l + 1, r, William(P)), P);
}
signed main() {
  read(n), read(P);
  for (long long i = 1; i <= n; i++) read(a[i]);
  for (read(Q); Q--;) {
    long long l, r;
    read(l), read(r);
    printf("%lld\n", (Nephren(l, r, P) % P + P) % P);
  }
  return 0;
}
