#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void upd1(T& a, T b) {
  a > b ? a = b : 0;
}
template <class T>
inline void upd2(T& a, T b) {
  a < b ? a = b : 0;
}
struct ano {
  operator long long() {
    long long x = 0, y = 0, c = getchar();
    while (c < 48) y = c == 45, c = getchar();
    while (c > 47) x = x * 10 + c - 48, c = getchar();
    return y ? -x : x;
  }
} buf;
int wop(int a, int n, int p) {
  int s = 1 % p;
  for (; n; n >>= 1) {
    if (n & 1) s = (long long)s * a % p;
    a = (long long)a * a % p;
  }
  return s;
}
int phi(int n) {
  int x = n;
  for (int j = 2; j * j <= n; ++j)
    if (n % j == 0) {
      x -= x / j;
      while (n % j == 0) n /= j;
    }
  if (n != 1) x -= x / n;
  return x;
}
const int N = 1e5 + 5;
int c[N], g[N], f[40];
int main() {
  int n = buf;
  f[0] = buf;
  for (int i = 0; f[i] != 1; ++i) f[i + 1] = phi(f[i]);
  for (int i = 1; i <= n; ++i) c[i] = buf;
  g[n + 1] = 1e9;
  for (int i = n; i >= 1; --i) g[i] = c[i] == 1 ? i : g[i + 1];
  int q = buf;
  while (q--) {
    int l = buf, r = min((int)buf, g[l]), s = 1;
    while (r >= l && pow(c[r], s) < 1e9) s = pow(c[r--], s) + .5;
    if (r < l)
      printf("%d\n", s % f[0]);
    else {
      function<int(int, int)> sol;
      sol = [&](int i, int j) {
        return f[j] == 1
                   ? 0
                   : wop(c[i], i == r ? s : sol(i + 1, j + 1) + f[j + 1], f[j]);
      };
      printf("%d\n", sol(l, 0));
    }
  }
}
