Problem: Priests of the Quetzalcoatl cult want to build a tower to represent a power of their god. Tower is usually made of power-charged rocks. It is built with the help of rare magic by levitating the current top of tower and adding rocks at its bottom. If top, which is built from k - 1 rocks, possesses power p and we want to add the rock charged with power wk then value of power of a new tower will be {wk}p. 

Rocks are added from the last to the first. That is for sequence w1, ..., wm value of power will be

<image>

After tower is built, its power may be extremely large. But still priests want to get some information about it, namely they want to know a number called cumulative power which is the true value of power taken modulo m. Priests have n rocks numbered from 1 to n. They ask you to calculate which value of cumulative power will the tower possess if they will build it from rocks numbered l, l + 1, ..., r. 

Input

First line of input contains two integers n (1 ≤ n ≤ 105) and m (1 ≤ m ≤ 109).

Second line of input contains n integers wk (1 ≤ wk ≤ 109) which is the power of rocks that priests have.

Third line of input contains single integer q (1 ≤ q ≤ 105) which is amount of queries from priests to you.

kth of next q lines contains two integers lk and rk (1 ≤ lk ≤ rk ≤ n). 

Output

Output q integers. k-th of them must be the amount of cumulative power the tower will have if is built from rocks lk, lk + 1, ..., rk.

Example

Input

6 1000000000
1 2 2 3 3 3
8
1 1
1 6
2 2
2 3
2 4
4 4
4 5
4 6


Output

1
1
2
4
256
3
27
597484987

Note

327 = 7625597484987

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
map<int, int> saved_phi;
int phi(int x) {
  if (saved_phi.count(x)) return saved_phi[x];
  int ans = x, xx = x;
  for (int i = 2; i * i <= xx; i++) {
    if (xx % i == 0) {
      do xx /= i;
      while (xx % i == 0);
      ans = ans / i * (i - 1);
    }
  }
  if (xx > 1) ans = ans / xx * (xx - 1);
  return saved_phi[x] = ans;
}
int modpow(int a, int b, int m) {
  if (b == 0) return 1;
  long long x = modpow(a, b / 2, m);
  x *= x;
  if (x > 32) x = (x - 32) % m + 32;
  if (b % 2) {
    x *= a;
    if (x > 32) x = (x - 32) % m + 32;
  }
  return x;
}
int w[100000];
int solve2(int l, int r, int cnt) {
  if (cnt >= 5) return 32;
  if (l == r || w[l] == 1) return 1;
  return modpow(w[l], solve2(l + 1, r, cnt + 1), 1);
}
int solve(int l, int r, int m) {
  if (m == 1) return solve2(l, r, 0);
  if (l == r || w[l] == 1) return 1;
  return modpow(w[l], solve(l + 1, r, phi(m)), m);
}
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", w + i);
  int q;
  scanf("%d", &q);
  while (q--) {
    int l, r;
    scanf("%d %d", &l, &r);
    l--;
    printf("%d\n", solve(l, r, m) % m);
  }
}