#include <bits/stdc++.h>
using namespace std;
const long long N = 1e2 + 10;
const long long Mod = 998244353;
long long add(long long a, long long b, long long mod = Mod) {
  return (a += b) >= mod ? a - mod : a;
}
long long sub(long long a, long long b, long long mod = Mod) {
  return (a -= b) < 0 ? a + mod : a;
}
long long mul(long long a, long long b, long long mod = Mod) {
  return 1ll * a * b % mod;
}
long long fast_pow(long long a, long long b, long long mod = Mod) {
  long long res = 1;
  for (; b; b >>= 1, a = mul(a, a, mod))
    if (b & 1) res = mul(res, a, mod);
  return res;
}
long long n, m, k, b[N];
struct Matrix {
  long long g[N][N];
  Matrix() { memset(g, 0, sizeof(g)); }
};
Matrix operator*(const Matrix a, const Matrix b) {
  Matrix c;
  for (long long i = 1; i <= k; i++)
    for (long long j = 1; j <= k; j++)
      for (long long p = 1; p <= k; p++)
        c.g[i][j] = add(c.g[i][j], mul(a.g[i][p], b.g[p][j], Mod - 1), Mod - 1);
  return c;
}
Matrix fast_pow(Matrix a, long long b) {
  Matrix res;
  for (long long i = 1; i <= k; i++) res.g[i][i] = 1;
  for (; b; b >>= 1, a = a * a)
    if (b & 1) res = res * a;
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
void exgcd(long long a, long long b, long long &x, long long &y) {
  if (!b) {
    x = 1, y = 0;
    return;
  }
  exgcd(b, a % b, y, x);
  y -= a / b * x;
}
long long exgcd(long long a, long long b, long long c) {
  long long g = gcd(a, b);
  if (c % g) return -1;
  long long x, y;
  exgcd(a, b, x, y);
  x *= c / g;
  x = (x % (b / g) + (b / g)) % (b / g);
  return x;
}
long long bsgs(long long a, long long b) {
  map<long long, long long> mp;
  mp[b] = 0;
  long long cur = 1, limit = sqrt(Mod);
  for (long long i = 1; i <= limit; i++) {
    cur = mul(cur, a);
    mp[mul(b, exgcd(cur, Mod, 1))] = i;
  }
  long long now = 1;
  for (long long i = 0; i <= limit; i++) {
    if (mp.count(now)) return limit * i + mp[now];
    now = mul(now, cur);
  }
  return -1;
}
int main() {
  scanf("%lld", &k);
  for (long long i = 1; i <= k; i++) scanf("%lld", &b[i]);
  scanf("%lld %lld", &n, &m);
  Matrix tmp;
  for (long long i = 1; i < k; i++) tmp.g[i][i + 1] = 1;
  for (long long i = 1; i <= k; i++) tmp.g[k][i] = b[k - i + 1];
  tmp = fast_pow(tmp, n - k);
  long long ans1 = bsgs(3, m), ans2 = exgcd(tmp.g[k][k], Mod - 1, ans1);
  if (ans1 == -1 || ans2 == -1)
    printf("-1");
  else
    printf("%lld", fast_pow(3, ans2));
  return 0;
}
