#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int f = 1, x = 0;
  char s = getchar();
  while (s < '0' || s > '9') {
    if (s == '-') f = -1;
    s = getchar();
  }
  while (s >= '0' && s <= '9') {
    x = x * 10 + s - 48;
    s = getchar();
  }
  return f * x;
}
const int p = 998244353, g = 3;
int k, n, m;
struct mat {
  int a[105][105];
  int n, m;
  void clear() {
    memset(a, 0, sizeof(a));
    n = m = 0;
  }
} base, ans;
mat operator*(mat a, mat b) {
  mat ans;
  ans.clear();
  ans.n = a.n, ans.m = b.m;
  for (int i = 1; i <= a.n; i++)
    for (int j = 1; j <= b.m; j++)
      for (int k = 1; k <= a.m; k++)
        ans.a[i][j] =
            (ans.a[i][j] + 1ll * a.a[i][k] * b.a[k][j] % (p - 1)) % (p - 1);
  return ans;
}
inline int ksm(int a, int b, int p) {
  int ans = 1;
  for (; b; b >>= 1, a = 1ll * a * a % p)
    if (b & 1) ans = 1ll * ans * a % p;
  return ans;
}
map<int, int> Hash;
int bsgs(int a, int b, int p) {
  Hash.clear();
  b %= p;
  int m = ceil(sqrt(1.0 * p));
  for (int i = 1; i <= m; i++) {
    b = 1ll * b * a % p;
    Hash[b] = i;
  }
  int tmp = ksm(a, m, p);
  b = 1;
  for (int i = 1; i <= m; i++) {
    b = 1ll * b * tmp % p;
    if (Hash[b]) return ((1ll * i * m - Hash[b]) % p + p) % p;
  }
  return -1;
}
int exgcd(int a, int b, int &x, int &y) {
  if (!b) {
    x = 1, y = 0;
    return a;
  }
  int ans = exgcd(b, a % b, y, x);
  y -= a / b * x;
  return ans;
}
int main() {
  k = read();
  ans.clear(), base.clear();
  base.n = base.m = k;
  for (int i = 1; i <= k; i++) base.a[i][1] = read();
  for (int i = 2; i <= k; i++) base.a[i - 1][i] = 1;
  n = read() - k, m = read();
  ans.n = 1, ans.m = k;
  ans.a[1][1] = 1;
  for (; n; n >>= 1, base = base * base)
    if (n & 1) ans = ans * base;
  int t = ans.a[1][1];
  int res = bsgs(g, m, p);
  int x, y;
  int GCD = exgcd((p - 1), t, x, y);
  y = (y % (p - 1) + p - 1) % (p - 1);
  if (res % GCD != 0)
    puts("-1");
  else {
    x = 1ll * y * (res / GCD) % (p - 1);
    int ans = ksm(g, x, p);
    printf("%d\n", ans);
  }
  return 0;
}
