#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
const int maxn = 1e8 + 5;
using namespace std;
int sequence[100050];
map<long long, long long> phi;
long long euler(long long n) {
  int ret = n;
  if (phi[ret]) return phi[ret];
  for (int i = 2; i <= sqrt(n + 0.5); i++) {
    if (n % i == 0) {
      ret = ret / i * (i - 1);
      while (n % i == 0) {
        n /= i;
      }
    }
  }
  if (n > 1) ret = ret / n * (n - 1);
  phi[n] = ret;
  return ret;
}
long long qpow(long long x, long long y, long long mod) {
  long long ret = 1;
  while (y) {
    if (y & 1) ret = ret * x < mod ? ret * x : ret * x % mod + mod;
    x = x * x < mod ? x * x : x * x % mod + mod;
    y >>= 1;
  }
  return ret;
}
long long Solve(long long a, long long b, long long mod) {
  if (mod == 1 || b == a)
    return sequence[a] < mod ? sequence[a] : sequence[a] % mod + mod;
  return qpow(sequence[a], Solve(a + 1, b, euler(mod)), mod);
}
int main() {
  int len, m, s;
  scanf("%d %d", &len, &m);
  for (int i = 1; i <= len; i++) scanf("%d", &sequence[i]);
  int qn;
  scanf("%d", &qn);
  long long l, r, ans;
  while (qn--) {
    scanf("%lld %lld", &l, &r);
    ans = Solve(l, r, m) % m;
    printf("%lld\n", ans);
  }
  return 0;
}
