#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const double PI = 4 * atan(1.0);
const int maxm = 1e8 + 5;
const int maxn = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const long long LINF = 1ll << 62;
map<long long, long long> mp;
long long a[maxn];
inline long long phi(long long x) {
  long long ans = x, tmp = x;
  if (mp.count(x)) return mp[x];
  for (int i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      ans = ans / i * (i - 1);
      while (x % i == 0) x /= i;
    }
  }
  if (x > 1) ans = ans / x * (x - 1);
  mp[tmp] = ans;
  return ans;
}
inline long long qpow(long long a, long long b, long long m) {
  long long res = 1;
  while (b) {
    if (1 & b) res = res * a > m ? (res * a % m + m) : res * a;
    a = a * a > m ? (a * a % m + m) : a * a;
    b >>= 1;
  }
  return res;
}
long long solve(long long index, long long r, long long m) {
  if (index == r || m == 1)
    return a[index] > m ? (a[index] % m + m) : a[index];
  else {
    long long euler = phi(m);
    long long k = solve(index + 1, r, euler);
    long long res = qpow(a[index], k, m);
    return res;
  }
}
int main() {
  long long n, m, q;
  scanf("%I64d %I64d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%I64d", &a[i]);
  scanf("%I64d", &q);
  while (q--) {
    int l, r;
    scanf("%d %d", &l, &r);
    printf("%I64d\n", solve(l, r, m) % m);
  }
  return 0;
}
