#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
const long long mod = 998244353, g = 3;
long long qpow(long long a, int k, const long long m = mod) {
  long long ans = 1;
  while (k) {
    if (k & 1) (ans *= a) %= m;
    (a *= a) %= m;
    k >>= 1;
  }
  return ans;
}
long long generator(int p) {
  vector<int> fact;
  int phi = p - 1, n = p - 1;
  for (int i = 2; i * i <= p; ++i) {
    if (n % i == 0) {
      fact.push_back(i);
      while (n % i == 0) {
        n /= i;
      }
    }
  }
  if (n > 1) fact.push_back(n);
  for (int ans = 2; ans <= p; ++ans) {
    bool ok = true;
    for (auto it : fact) {
      ok &= pow(ans, phi / it) != 1;
      if (!ok) break;
    }
    if (ok) return ans;
  }
  return -1;
}
int K;
struct matrix {
  long long m[100][100];
  matrix() { memset(m, 0, sizeof m); }
  matrix(matrix &other) { memcpy(m, other.m, sizeof m); }
  long long *operator[](int n) { return m[n]; }
  matrix operator*(matrix &other) {
    matrix ans;
    for (int i = 0; i < K; ++i) {
      for (int k = 0; k < K; ++k) {
        for (int j = 0; j < K; ++j) {
          (ans[i][j] += m[i][k] * other[k][j]) %= (mod - 1);
        }
      }
    }
    return ans;
  }
  void pow(int k) {
    --k;
    matrix a(*this);
    while (k) {
      if (k & 1) (*this) = a * (*this);
      a = a * a;
      k >>= 1;
    }
  }
  void print() const {
    for (int i = 0; i < K; ++i, putchar('\n')) {
      for (int j = 0; j < K; ++j) {
        printf("%4lld", m[i][j]);
      }
    }
  }
} mat;
long long gcd(long long x, long long y) {
  long long temp;
  while (y) {
    temp = x % y;
    x = y;
    y = temp;
  }
  return x;
}
long long exgcd(long long a, long long b, long long &x, long long &y) {
  if (!b) {
    x = 1, y = 0;
    return a;
  }
  long long q = exgcd(b, a % b, y, x);
  y -= a / b * x;
  return q;
}
long long phi(long long x) {
  long long ans = x;
  for (int i = 2; i * i <= x; ++i) {
    if (x % i == 0) {
      ans = ans / i * (i - 1);
      while (x % i == 0) x /= i;
    }
  }
  if (x > 1) ans = ans / x * (x - 1);
  return ans;
}
long long get_inverse(long long a, long long c, long long m) {
  long long p = gcd(a, m);
  if (c % p != 0) return -1;
  a /= p, c /= p;
  long long new_mod = m / p;
  return qpow(a, phi(new_mod) - 1, new_mod) * c % new_mod;
}
long long BSGS(long long a, long long b, const long long m) {
  long long n = sqrt(m) + 1;
  long long cur = b;
  unordered_map<long long, long long, custom_hash> val;
  for (long long p = 0; p < n; ++p) {
    val[cur] = p;
    cur = (cur * g) % m;
  }
  cur = qpow(g, n, m);
  long long now = cur;
  for (long long q = 1; q <= n + 1; ++q) {
    if (val.count(now)) return q * n - val[now];
    now = now * cur % m;
  }
  return -1;
}
int main() {
  scanf("%d", &K);
  for (int i = 0; i < K; ++i) scanf("%lld", mat[0] + i), mat[0][i] %= (mod - 1);
  for (int i = 1; i < K; ++i) mat[i][i - 1] = 1;
  int n, m;
  scanf("%d%d", &n, &m);
  mat.pow(n - K);
  long long c = mat[0][0];
  long long pm = BSGS(3, m, mod);
  long long px = get_inverse(c, pm, mod - 1);
  if (px == -1) {
    printf("-1\n");
  } else {
    printf("%lld\n", qpow(3, px, mod));
  }
  return 0;
}
