#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a > b) {
    swap(a, b);
  }
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
long long mp(long long a, long long n, long long m) {
  long long r = 1;
  while (n) {
    if (n & 1) {
      r = r * a % m;
    }
    a = a * a % m;
    n >>= 1;
  }
  return r;
}
long long BG(long long X, long long Y, long long M) {
  unordered_map<long long, long long> D;
  D[1] = 1;
  long long S = 31596;
  long long Z = 1;
  for (int i = 1; i <= S; i++) {
    Z = (Z * X) % M;
    D[Z] = i + 1;
  }
  if (D[Y]) {
    return D[Y] - 1;
  }
  long long R = mp(Z, M - 2, M);
  for (int i = 1; i <= S; i++) {
    Y = Y * R % M;
    if (D[Y]) {
      return D[Y] + i * S - 1;
    }
  }
  return -1;
}
const long long mod = 998244352;
vector<vector<long long>> m(vector<vector<long long>> a,
                            vector<vector<long long>> b, long long md) {
  vector<vector<long long>> r(a.size(), vector<long long>(b[0].size(), 0));
  for (int i = 0; i < (int)(a.size()); i++) {
    for (int k = 0; k < (int)(b.size()); k++) {
      for (int j = 0; j < (int)(b[0].size()); j++) {
        r[i][j] = (r[i][j] + a[i][k] * b[k][j]) % md;
      }
    }
  }
  return r;
}
vector<vector<long long>> p(vector<vector<long long>> a, long long n,
                            long long md) {
  vector<vector<long long>> r(a.size(), vector<long long>(a.size(), 0));
  for (int i = 0; i < (int)(a.size()); i++) {
    r[i][i] = 1;
  }
  while (n) {
    if (n & 1) {
      r = m(a, r, md);
    }
    a = m(a, a, md);
    n >>= 1;
  }
  return r;
}
int main() {
  long long K, N, M;
  scanf("%lld", &K);
  vector<long long> B(K);
  for (int i = 0; i < K; i++) {
    scanf("%lld", &B[i]);
  }
  scanf("%lld%lld", &N, &M);
  if (M == 1) {
    printf("1\n");
    return 0;
  }
  vector<vector<long long>> X(K, vector<long long>(K, 0));
  vector<vector<long long>> Y(K, vector<long long>(K, 0));
  Y[0][K - 1] = 1;
  for (int i = 0; i < K - 1; i++) {
    X[i + 1][i] = 1;
    X[0][i] = (B[i] % mod);
  }
  X[0][K - 1] = (B[K - 1] % mod);
  vector<vector<long long>> Z = m(p(X, N - K, mod), Y, mod);
  long long W = Z[0][K - 1];
  long long V = BG(3, M, mod + 1);
  if (W == 0) {
    printf("-1\n");
    return 0;
  }
  long long G = gcd(V, mod), H = gcd(W, mod);
  if (G % H) {
    printf("-1\n");
    return 0;
  }
  long long a = W / H, b = mod / H, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    u -= t * v;
    swap(u, v);
    a -= t * b;
    swap(a, b);
  }
  u %= (mod / H);
  if (u < 0) {
    u += (mod / H);
  }
  printf("%lld\n", mp(3, (u * (V / H)) % (mod / H), mod + 1));
  return 0;
}
