Problem: Lunar New Year is approaching, and Bob received a gift from his friend recently — a recursive sequence! He loves this sequence very much and wants to play with it.

Let f_1, f_2, …, f_i, … be an infinite sequence of positive integers. Bob knows that for i > k, f_i can be obtained by the following recursive equation:

$$$f_i = \left(f_{i - 1} ^ {b_1} ⋅ f_{i - 2} ^ {b_2} ⋅ ⋅⋅⋅ ⋅ f_{i - k} ^ {b_k}\right) mod p,$$$

which in short is

$$$f_i = \left(∏_{j = 1}^{k} f_{i - j}^{b_j}\right) mod p,$$$

where p = 998 244 353 (a widely-used prime), b_1, b_2, …, b_k are known integer constants, and x mod y denotes the remainder of x divided by y.

Bob lost the values of f_1, f_2, …, f_k, which is extremely troublesome – these are the basis of the sequence! Luckily, Bob remembers the first k - 1 elements of the sequence: f_1 = f_2 = … = f_{k - 1} = 1 and the n-th element: f_n = m. Please find any possible value of f_k. If no solution exists, just tell Bob that it is impossible to recover his favorite sequence, regardless of Bob's sadness.

Input

The first line contains a positive integer k (1 ≤ k ≤ 100), denoting the length of the sequence b_1, b_2, …, b_k.

The second line contains k positive integers b_1, b_2, …, b_k (1 ≤ b_i < p).

The third line contains two positive integers n and m (k < n ≤ 10^9, 1 ≤ m < p), which implies f_n = m.

Output

Output a possible value of f_k, where f_k is a positive integer satisfying 1 ≤ f_k < p. If there are multiple answers, print any of them. If no such f_k makes f_n = m, output -1 instead.

It is easy to show that if there are some possible values of f_k, there must be at least one satisfying 1 ≤ f_k < p.

Examples

Input


3
2 3 5
4 16


Output


4


Input


5
4 7 1 5 6
7 14187219


Output


6


Input


8
2 3 5 6 1 7 9 10
23333 1


Output


1


Input


1
2
88888 66666


Output


-1


Input


3
998244352 998244352 998244352
4 2


Output


-1


Input


10
283 463 213 777 346 201 463 283 102 999
2333333 6263423


Output


382480067

Note

In the first sample, we have f_4 = f_3^2 ⋅ f_2^3 ⋅ f_1^5. Therefore, applying f_3 = 4, we have f_4 = 16. Note that there can be multiple answers.

In the third sample, applying f_7 = 1 makes f_{23333} = 1.

In the fourth sample, no such f_1 makes f_{88888} = 66666. Therefore, we output -1 instead.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long INF = 200000000000000000LL;
const long double EPS = 1e-9;
const int inf = 0x3f3f3f3f;
const int MOD = 998244353;
struct matrix {
  int row, col;
  int v[107][107];
  matrix() { memset(v, 0, sizeof v); }
  matrix(int r, int c) : row(r), col(c) { memset(v, 0, sizeof v); }
  matrix operator*(const matrix &p) {
    assert(col == p.row);
    matrix ret(row, p.col);
    long long mod2 = (long long)998244352 * 998244352;
    for (int i = 0; i < ret.row; ++i) {
      for (int j = 0; j < ret.col; ++j) {
        long long sum = 0;
        for (int k = 0; k < col; ++k) {
          sum += (1LL * v[i][k] * p.v[k][j]);
          if (sum >= mod2) sum -= mod2;
        }
        ret.v[i][j] = sum % 998244352;
      }
    }
    return ret;
  }
  matrix power(int p) {
    assert(row == col);
    matrix base = *this;
    matrix ret(row, col);
    for (int i = 0; i < row; ++i) ret.v[i][i] = 1;
    while (p > 0) {
      if (p & 1) ret = ret * base;
      base = base * base;
      p >>= 1;
    }
    return ret;
  }
};
inline int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int powmod(int a, int b, int p) {
  int res = 1;
  while (b > 0) {
    if (b & 1) {
      res = (1LL * res * a) % p;
    }
    a = (1LL * a * a) % p;
    b >>= 1;
  }
  return res;
}
int primitive_root(int p) {
  vector<int> fact;
  int phi = p - 1, n = phi;
  for (int i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      fact.push_back(i);
      while (n % i == 0) n /= i;
    }
  }
  if (n > 1) fact.push_back(n);
  for (int res = 2; res <= p; ++res) {
    bool ok = true;
    for (int factor : fact) {
      if (powmod(res, phi / factor, p) == 1) {
        ok = false;
        break;
      }
    }
    if (ok) return res;
  }
  return -1;
}
int discrete_log(int a, int b, int m) {
  int n = (int)sqrt(m + .0) + 1;
  map<int, int> vals;
  for (int p = n; p >= 1; --p) vals[powmod(a, p * n, m)] = p;
  for (int q = 0; q <= n; ++q) {
    int cur = (powmod(a, q, m) * b) % m;
    if (vals.count(cur)) {
      int ans = vals[cur] * n - q;
      return ans;
    }
  }
  return -1;
}
vector<int> discrete_root(int n, int k, int a) {
  if (a == 0) {
    return vector<int>(1, 0);
  }
  int g = primitive_root(n);
  int sq = (int)sqrt(n + .0) + 1;
  vector<pair<int, int> > dec(sq);
  for (int i = 1; i <= sq; ++i)
    dec[i - 1] = make_pair(powmod(g, int(i * sq * 1ll * k % (n - 1)), n), i);
  sort(dec.begin(), dec.end());
  int any_ans = -1;
  for (int i = 0; i < sq; ++i) {
    int my = int(powmod(g, int(i * 1ll * k % (n - 1)), n) * 1ll * a % n);
    vector<pair<int, int> >::iterator it =
        lower_bound(dec.begin(), dec.end(), make_pair(my, 0));
    if (it != dec.end() && it->first == my) {
      any_ans = it->second * sq - i;
      break;
    }
  }
  if (any_ans == -1) {
    return vector<int>();
  }
  int delta = (n - 1) / gcd(k, n - 1);
  vector<int> ans;
  for (int cur = any_ans % delta; cur < n - 1; cur += delta) {
    ans.push_back(powmod(g, cur, n));
    break;
  }
  sort(ans.begin(), ans.end());
  return ans;
}
const int N = 107;
int b[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int k;
  cin >> k;
  for (int i = 0; i < k; ++i) cin >> b[i];
  int n, m;
  cin >> n >> m;
  matrix mat(k, k);
  for (int i = 0; i < k; ++i) mat.v[0][i] = b[i];
  for (int i = 1; i < k; ++i) mat.v[i][i - 1] = 1;
  mat = mat.power(n - k);
  int p = mat.v[0][0];
  auto res = discrete_root(MOD, p, m);
  if (res.empty()) res.push_back(-1);
  cout << res.front() << "\n";
  return 0;
}