#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long n, mod, a[N], q;
long long qpow(long long a, long long b, long long m) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a >= m ? res * a % m + m : res * a);
    a = a * a >= m ? a * a % m + m : a * a;
    b >>= 1;
  }
  return res;
}
map<long long, long long> mp;
long long myphi(long long n) {
  if (mp.count(n)) return mp[n];
  long long ans = n;
  long long num = n;
  for (int i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      ans -= ans / i;
      while (n % i == 0) n /= i;
    }
  }
  if (n > 1) ans -= ans / n;
  mp[num] = ans;
  return ans;
}
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, myphi(mod)), mod);
}
int main() {
  scanf("%lld%lld", &n, &mod);
  for (int 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);
  }
  return 0;
}
