#include <bits/stdc++.h>
using namespace std;
using ll = long long;
long long okay(long long val, long long mod) {
  if (val < mod) {
    return val;
  }
  return (val % mod) + mod;
}
long long powM(long long a, long long b, long long mod) {
  long long res = 1;
  while (b) {
    if (b & 1) {
      res = okay(1LL * res * a, mod);
    }
    a = okay(1LL * a * a, mod);
    b >>= 1;
  }
  return res;
}
long long sz = 0;
const long long N = 1e5 + 10;
long long mod[5000];
long long arr[N];
long long phi(long long a) {
  long long ans = a;
  for (long long i = 2; i * i <= a; i++) {
    long long cnt = 0;
    while (a % i == 0) a /= i, cnt++;
    if (cnt != 0) ans -= ans / i;
  }
  if (a != 1) {
    ans -= ans / a;
  }
  return ans;
}
long long findans(long long l, long long r, long long cur) {
  if (cur == sz) return 1;
  if (l == r) return okay(arr[l], mod[cur]);
  long long x = findans(l + 1, r, cur + 1);
  long long p = x % mod[cur];
  if (x >= mod[cur]) p = p + mod[cur];
  long long ans = powM(arr[l], p, mod[cur]);
  return ans;
}
signed main() {
  long long n, m;
  cin >> n >> m;
  mod[sz] = m;
  while (mod[sz] != 1) {
    sz++;
    mod[sz] = phi(mod[sz - 1]);
  }
  for (long long i = 1; i <= n; i++) cin >> arr[i];
  long long q;
  cin >> q;
  while (q--) {
    long long l, r;
    cin >> l >> r;
    cout << findans(l, r, 0) % m << endl;
  }
}
