#include <bits/stdc++.h>
using namespace std;
const int MX = 100005;
int n, m, w[MX], q, l, r;
bitset<MX> bs;
vector<long long> pr;
void criba() {
  for (long long i = 2; i < MX; i++)
    if (!bs[i]) {
      pr.push_back(i);
      for (long long j = i * i; j < MX; j += i) bs[j] = 1;
    }
}
map<int, int> mp;
long long phi(long long n) {
  if (mp.count(n)) return mp[n];
  long long res = n, aux = n;
  int i = 0;
  while (pr[i] * pr[i] <= n) {
    if (n % pr[i] == 0) res -= res / pr[i];
    while (n % pr[i] == 0) n /= pr[i];
    i++;
  }
  if (n != 1) res -= res / n;
  return mp[aux] = res;
}
long long mod(long long x, long long y) {
  if (x < y) return x;
  return x % y + y;
}
long long pot(long long b, long long p, long long m) {
  long long res = 1;
  while (p) {
    if (p & 1) res = mod(res * b, m);
    b = mod(b * b, m);
    p /= 2;
  }
  return res;
}
long long obtRes(int l, int r, int m) {
  if (l == r || m == 1) return mod(w[l], m);
  return pot(w[l], obtRes(l + 1, r, phi(m)), m);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  criba();
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> w[i];
  cin >> q;
  while (q--) {
    cin >> l >> r;
    cout << obtRes(l, r, m) % m << '\n';
  }
  return 0;
}
