#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 30;
const long long INF = 1LL << 60;
const int MaxN = 100000;
long long n, Q, Pt;
map<long long, long long> phi;
long long a[MaxN + 5];
inline long long Mod(long long x, long long y) {
  return (x < y ? x : x % y + y);
}
long long qwr(long long x, long long y, long long mod) {
  long long res = 1LL;
  while (y > 0) {
    if (y & 1) res = Mod(res * x, mod);
    x = Mod(x * x, mod);
    y = y >> 1;
  }
  return res;
}
long long Get_phi(long long n) {
  if (phi[n]) return phi[n];
  long long t = (long long)sqrt(1.0 * n + 0.5);
  long long res = n, x = n;
  for (int i = 2; i <= t; i++) {
    if (n % i == 0) {
      res = res / i * (i - 1);
      while (n % i == 0) n /= i;
    }
  }
  if (n > 1) res = res / n * (n - 1);
  phi[x] = res;
  return res;
}
long long Solve(int l, int r, long long mod) {
  if (l == r || mod == 1) return Mod(a[l], mod);
  long long ans = Solve(l + 1, r, Get_phi(mod));
  return qwr(a[l], ans, mod);
}
int main() {
  while (scanf("%lld %lld", &n, &Pt) != EOF) {
    for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
    scanf("%d", &Q);
    while (Q--) {
      int l, r;
      scanf("%d %d", &l, &r);
      printf("%lld\n", Solve(l, r, Pt) % Pt);
    }
  }
  return 0;
}
