#include <bits/stdc++.h>
using namespace std;
template <typename T = long long>
inline T read() {
  T s = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    s = (s << 3) + (s << 1) + ch - 48;
    ch = getchar();
  }
  return s * f;
}
const int N = 1e5 + 5, M = 1e6 + 5, MOD = 1e9 + 7, CM = 998244353,
          INF = 0x3f3f3f3f;
std::map<int, int> mp;
int phi(int n) {
  if (mp.count(n)) return mp[n];
  int t = 1, i;
  if (!(n & 1))
    for (n >>= 1; !(n & 1); n >>= 1, t <<= 1)
      ;
  for (int i = 3; i * i <= n; i++)
    if (n % i == 0)
      for (n /= i, t *= i - 1; n % i == 0; n /= i, t *= i)
        ;
  if (n > 1) t *= n - 1;
  return mp[n] = t;
}
pair<long long, bool> ksm(long long a, long long b, long long p) {
  pair<long long, bool> ans = {1, 0};
  while (b) {
    if (b & 1) {
      if (ans.first * a >= p) ans.second = 1;
      ans.first = ans.first * a % p;
    }
    if (a * a >= p) ans.second = 1;
    a = a * a % p;
    b >>= 1;
  }
  return ans;
}
int a[N];
pair<long long, bool> cal(long long pos, long long b, long long p) {
  if (p == 1) return {1, 1};
  if (pos == b + 1) return {1, 0};
  long long ph = phi(p);
  pair<long long, bool> ss = cal(pos + 1, b, ph);
  return ksm(a[pos], ss.second ? ss.first % ph + ph : ss.first % ph, p);
}
void solve(int kase) {
  int n = read(), m = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  int q = read();
  for (int i = 1; i <= q; i++) {
    int l = read(), r = read();
    printf("%lld\n", cal(l, r, m).first % m);
  }
}
const bool DUO = 0;
int main() {
  clock_t start, finish;
  double totaltime;
  start = clock();
  if (DUO) {
    int Kase = 0;
    cin >> Kase;
    for (int kase = 1; kase <= Kase; kase++) solve(kase);
  } else
    solve(1);
  finish = clock();
  return 0;
  printf("\nTime: %lfms\n", (double)(finish - start) / CLOCKS_PER_SEC * 1000);
  return 0;
}
