#include <bits/stdc++.h>
using namespace std;
const int p = 998244353, g = 3;
int B[105];
unordered_map<long long, long long> mp;
struct mat {
  int a[105][105];
  int n, m;
  void init0() { memset(a, 0, sizeof(a)); }
  void init1() {
    memset(a, 0, sizeof(a));
    for (int i = 1; i <= min(n, m); i++) a[i][i] = 1;
  }
};
mat operator*(mat a, mat b) {
  mat ret;
  ret.n = a.n, ret.m = b.m;
  ret.init0();
  for (int i = 1; i <= a.n; i++) {
    for (int j = 1; j <= b.m; j++) {
      for (int k = 1; k <= a.m; k++)
        ret.a[i][j] = (ret.a[i][j] + 1ll * a.a[i][k] * b.a[k][j]) % (p - 1);
    }
  }
  return ret;
}
int exgcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1, y = 0;
    return a;
  }
  int gcd = exgcd(b, a % b, x, y);
  int y2 = y, x2 = x;
  x = y2, y = x2 - a / b * y2;
  return gcd;
}
int BSGS(int b) {
  mp.clear();
  int t = 1, v = 1, x, y, m = ceil(sqrt(p));
  for (int i = 0; i < m; i++) mp[t] = i, t = 1ll * t * g % p;
  for (int i = 0; i < m; i++) {
    int gcd = exgcd(v, p, x, y);
    x = ((1ll * x * b / gcd) % p + p) % p;
    if (mp[x]) return i * m + mp[x];
    v = 1ll * v * t % p;
  }
  return -1;
}
mat kissme(mat a, int x) {
  mat ret;
  ret.n = a.n, ret.m = a.m;
  ret.init1();
  for (; x; x >>= 1) {
    if (x & 1) ret = ret * a;
    a = a * a;
  }
  return ret;
}
int kissme(int a, int x) {
  int ret = 1;
  for (; x; x >>= 1) {
    if (x & 1) ret = 1ll * ret * a % p;
    a = 1ll * a * a % p;
  }
  return ret;
}
int geta(int n, int k) {
  mat t;
  t.n = k, t.m = k;
  t.init0();
  for (int i = 1; i <= k; i++) t.a[1][i] = B[i];
  for (int i = 2; i <= k; i++) t.a[i][i - 1] = 1;
  t = kissme(t, n - k);
  return t.a[1][1];
}
int solve(int n, int b, int k) {
  int a = geta(n, k), t1 = BSGS(b), x, y;
  int gcd = exgcd(a, p - 1, x, y);
  if (t1 % gcd) return -1;
  x = ((1ll * x * t1 / gcd) % (p - 1) + (p - 1)) % (p - 1);
  return kissme(g, x);
}
int main() {
  int n, fn, k;
  scanf("%d", &k);
  for (int i = 1; i <= k; i++) scanf("%d", &B[i]);
  scanf("%d%d", &n, &fn);
  printf("%d\n", solve(n, fn, k));
  return 0;
}
