#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
template <class T>
void rd(T &x) {
  x = 0;
  char c = getchar();
  long long f = 1;
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
  x *= f;
}
template <class T>
void pt(T x) {
  if (x < 0) putchar('-'), x = (~x) + 1;
  if (x > 9) pt(x / 10);
  putchar((x % 10) ^ 48);
}
template <class T>
T Min(T x, T y) {
  return x < y ? x : y;
}
template <class T>
T Max(T x, T y) {
  return x > y ? x : y;
}
const int N = 1e5 + 5;
map<int, int> Map;
int n, mod, q, l, r, a[N];
int Mod(long long x, int p) { return x < p ? x : x % p + p; }
int qkpow(int a, int b, int mod) {
  int res = 1;
  while (b) {
    if (b & 1) res = Mod(1ll * res * a, mod);
    b >>= 1;
    a = Mod(1ll * a * a, mod);
  }
  return res;
}
int phi(int n) {
  if (Map.count(n)) return Map[n];
  int res = n, pos = n;
  for (int i = 2; i * i <= n; i++)
    if (n % i == 0) {
      res = res / i * (i - 1);
      while (n % i == 0) n /= i;
    }
  if (n > 1) res = res / n * (n - 1);
  return Map[pos] = res;
}
int solve(int l, int r, int mod) {
  if (l == r || mod == 1) return Mod(a[l], mod);
  return qkpow(a[l], solve(l + 1, r, phi(mod)), mod);
}
int main() {
  rd(n), rd(mod);
  for (int i = 1; i <= n; i++) rd(a[i]);
  rd(q);
  while (q--) {
    rd(l), rd(r);
    pt(solve(l, r, mod) % mod);
    puts("");
  }
  return 0;
}
