#include <bits/stdc++.h>
using namespace std;
long long n, m, a[100010], p[100010];
long long phi(long long x) {
  long long ans = 1;
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      ans *= i - 1;
      x /= i;
      while (x % i == 0) {
        ans *= i;
        x /= i;
      }
    }
  }
  if (x > 1) ans *= x - 1;
  return ans;
}
long long Pow(long long x, long long y, long long MOD) {
  long long ans = 1;
  while (y) {
    if (y & 1) {
      ans = (ans * x) % MOD;
    }
    x = (x * x) % MOD;
    y /= 2;
  }
  return ans;
}
long long solve(long long l, long long r, long long x) {
  long long MOD = p[x];
  if (l == r) return min(a[l] % MOD + MOD, a[l]);
  if (MOD == 1 || a[l] == 1) return 1;
  long long Po = solve(l + 1, r, x + 1);
  long long now = 1;
  for (long long i = 1; i <= Po; i++) {
    now *= a[l];
    if (now > MOD) break;
  }
  if (now <= MOD) return now;
  return Pow(a[l], Po, MOD) + MOD;
}
int main() {
  std::cin.sync_with_stdio(0);
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  p[1] = m;
  for (long long i = 2; i <= n; i++) {
    p[i] = phi(p[i - 1]);
  }
  long long q, l, r;
  cin >> q;
  for (long long i = 1; i <= q; i++) {
    cin >> l >> r;
    cout << solve(l, r, 1) % p[1] << endl;
  }
  return 0;
}
