#include <bits/stdc++.h>
using namespace std;
long long n, m, w[100005], phi[105], q, cnt;
bool flag = false;
long long poww(long long a, long long b, long long p) {
  long long ans = 1;
  flag = false;
  if (a > p) {
    flag = true;
    a %= p;
  }
  while (b > 0) {
    if (b % 2 == 1) {
      ans *= a;
      if (ans > p) {
        flag = true;
        ans %= p;
      }
    }
    a *= a;
    if (a > p) {
      flag = true;
      a %= p;
    }
    b /= 2;
  }
  if (flag) ans += p;
  return ans;
}
long long solve(long long l, long long r, long long step) {
  long long mod = phi[step], num = w[l];
  if (mod == 1) return mod;
  if (l == r) return num >= mod ? num % mod + mod : num;
  long long tmpp = solve(l + 1, r, step + 1);
  return poww(num, tmpp, mod);
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> w[i];
  int tmp = m;
  while (tmp > 1) {
    cnt++;
    phi[cnt] = tmp;
    int tmpm = tmp;
    for (int i = 2; i * i <= m; i++) {
      if (tmpm % i == 0) {
        phi[cnt] = phi[cnt] * (i - 1) / i;
        while (tmpm % i == 0) tmpm /= i;
      }
    }
    if (tmpm > 1) {
      phi[cnt] = phi[cnt] * (tmpm - 1) / tmpm;
    }
    tmp = phi[cnt];
    if (tmp == 1) break;
  }
  phi[0] = m;
  cin >> q;
  while (q--) {
    long long l, r;
    cin >> l >> r;
    cout << solve(l, r, 0) % m << endl;
  }
  return 0;
}
