#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 50;
int n, m, q;
int w[N];
map<int, int> f;
long long modu(long long ans, long long mod) {
  return ans <= mod ? ans : ans % mod + mod;
}
long long qPow(long long a, long long b, long long mod) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = modu(ans * a, mod);
    a = modu(a * a, mod);
    b >>= 1;
  }
  return ans;
}
int getPhi(int x) {
  int ans = 1;
  for (int i = 2; i * i <= x; ++i) {
    if (x % i != 0) continue;
    ans *= (i - 1);
    x /= i;
    while (x % i == 0) {
      x /= i;
      ans *= i;
    }
  }
  if (x > 1) ans *= (x - 1);
  return ans;
}
int Calc(int l, int r, int p) {
  if (l == r) return w[l];
  if (p == 1) return 1;
  return qPow(w[l], Calc(l + 1, r, f[p]), p);
}
void Solve() {
  f.clear();
  int tmp = m;
  while (tmp != 1) {
    f[tmp] = getPhi(tmp);
    tmp = f[tmp];
  }
  while (q--) {
    int l, r;
    scanf("%d%d", &l, &r);
    printf("%d\n", Calc(l, r, m) % m);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf("%d", w + i);
  scanf("%d", &q);
  Solve();
  return 0;
}
