#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-6;
const int inf = 0x3f3f3f3f;
const int maxn = 100000 + 10;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
long long n, q, mod, a[maxn];
map<long long, long long> mp;
long long qpow(long long x, long long n, long long mod) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x < mod ? res * x : res * x % mod + mod;
    x = x * x < mod ? x * x : x * x % mod + mod;
    n >>= 1;
  }
  return res;
}
long long phi(long long n) {
  long long x = n;
  if (mp.count(n)) return mp[n];
  int res = n;
  for (long long i = 2; i <= sqrt(n); ++i) {
    if (n % i == 0) {
      res = res / i * (i - 1);
      while (n % i == 0) n /= i;
    }
  }
  if (n > 1) res = res / n * (n - 1);
  mp[x] = res;
  return res;
}
long long solve(long long l, long long r, long long mod) {
  if (l == r || mod == 1) return a[l] < mod ? a[l] : a[l] % mod + mod;
  return qpow(a[l], solve(l + 1, r, phi(mod)), mod);
}
int main() {
  scanf("%lld %lld", &n, &mod);
  for (long long i = 1; i <= n; ++i) scanf("%lld", &a[i]);
  scanf("%lld", &q);
  while (q--) {
    int l, r;
    scanf("%d %d", &l, &r);
    printf("%lld\n", solve(l, r, mod) % mod);
  }
}
