#include <bits/stdc++.h>
using namespace std;
const long long N = 101010;
const long long qwq = 303030;
const long long inf = 0x3f3f3f3f;
long long n, m, mp;
long long a[N];
map<long long, long long> f;
inline long long read() {
  long long sum = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    sum = sum * 10 + c - '0';
    c = getchar();
  }
  return sum * f;
}
long long fai(long long now) {
  if (f[now]) return f[now];
  long long sq = sqrt(now), res = now, u = now;
  for (long long i = 2; i <= sq; i++) {
    if (now % i) continue;
    res = res / i * (i - 1);
    while (now % i == 0) now /= i;
  }
  if (now != 1) res = res / now * (now - 1);
  return f[u] = res;
}
long long ksm(long long aa, long long bb, long long p) {
  long long sum = 1, chao = 0;
  while (bb) {
    if (bb & 1) sum = sum * aa;
    bb >>= 1;
    aa = aa * aa;
    if (sum >= p || aa >= p) chao = 1;
    sum %= p;
    aa %= p;
  }
  return sum + (chao ? p : 0);
}
long long cheng(long long l, long long r, long long p) {
  if (p == 1) return 1;
  if (l == r + 1) return 1;
  return ksm(a[l], cheng(l + 1, r, fai(p)), p);
}
int main() {
  long long x, y;
  n = read();
  mp = read();
  for (long long i = 1; i <= n; i++) a[i] = read();
  m = read();
  while (m--) {
    x = read();
    y = read();
    cout << cheng(x, y, mp) % mp << "\n";
  }
  return 0;
}
