#include <bits/stdc++.h>
using namespace std;
template <typename T>
void mul(T &a, T &b, int k) {
  T c(k * k, 0);
  for (int i = 0; i < k; ++i)
    for (int j = 0; j < k; ++j) {
      for (int t = 0; t < k; ++t)
        c[i * k + j] =
            (c[i * k + j] + a[i * k + t] * b[t * k + j]) % (998244353 - 1);
    }
  copy(c.begin(), c.end(), a.begin());
}
template <typename T>
int64_t power(T &a, int k, int n) {
  T r(k * k);
  for (int i = 0; i < k; ++i) r[i * k + i] = 1;
  for (int t = 1; t <= n; t *= 2) {
    if (t & n) mul(r, a, k);
    mul(a, a, k);
  }
  return r[0];
}
int64_t power(int64_t x, int n) {
  int64_t r = 1;
  int t = 1;
  for (int t = 1; t <= n; t *= 2) {
    if (t & n) r = r * x % 998244353;
    x = x * x % 998244353;
  }
  return r;
}
template <typename T>
int find(T &u, int x) {
  int l = 0, r = u.size() - 1;
  while (l < r) {
    int i = (l + r) / 2;
    if (u[i].first < x) {
      l = i + 1;
    } else {
      r = i;
    }
  }
  if (l < u.size() && x == u[l].first)
    return u[l].second;
  else
    return -1;
}
int dlog(int64_t a, int64_t y) {
  vector<pair<int64_t, int>> u(31596), v(31596);
  int64_t x = power(a, 31596);
  int64_t r;
  int i, j;
  r = x;
  for (i = 0; i < 31596; ++i, r = r * x % 998244353)
    u[i] = pair<int64_t, int>(r, i);
  sort(u.begin(), u.end());
  r = y * a % 998244353;
  for (i = 0; i < 31596; ++i, r = r * a % 998244353)
    if ((j = find(u, r)) != -1) break;
  i++;
  j++;
  return (998244353 - 1 + 31596 * j - i) % (998244353 - 1);
}
int64_t gcd(int64_t a, int64_t b) {
  while (a % b) {
    int64_t c = a % b;
    a = b;
    b = c;
  }
  return b;
}
int64_t inverse(int64_t a, int64_t n) {
  int64_t tmp;
  int64_t t = 0, t1 = 1;
  int64_t r = n, r1 = a;
  while (r1 != 0) {
    int64_t q = r / r1;
    tmp = t - q * t1;
    t = t1;
    t1 = tmp;
    tmp = r - q * r1;
    r = r1;
    r1 = tmp;
  }
  if (t < 0) t = t % n + n;
  return t;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  int n, m, k;
  cin >> k;
  vector<int64_t> a(k * k, 0);
  for (int i = 0; i < k; ++i) cin >> a[i];
  for (int i = 0; i < k - 1; ++i) a[k * (i + 1) + i] = 1;
  cin >> n >> m;
  int64_t e = power(a, k, n - k);
  int64_t y = dlog(3, m);
  if (e != 0) {
    int64_t d = gcd(e, 998244353 - 1);
    if (y % d != 0) {
      cout << -1 << endl;
    } else {
      int r = y / d * inverse(e / d, (998244353 - 1) / d) % (998244353 - 1);
      cout << power(3, r) << endl;
    }
  } else {
    if (y != 0) {
      cout << -1 << endl;
    } else {
      cout << 1 << endl;
    }
  }
  return 0;
}
