#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

long long pow(long long a, long long k, long long m)
{
  long long ret = 1;
  for (a %= m; k > 0; k >>= 1, a = a * a % m) if (k & 1) ret = ret * a % m;
  return ret;
}

int main()
{
  const int mod = 998244353;
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) cin >> a[i];
  long long ans = 1;
  long long sum = 1;
  for (int i = 0; i < n; ++i)
  {
    ans = ans * min(a[i], k) % mod;
    sum = sum * min(a[i], k - 1) % mod;
  }
  ans = (ans - sum + mod) % mod;
  sum = 1;
  for (int i = 0; i < n; ++i) sum = sum * a[i] % mod;
  ans = ans * pow(sum, mod - 2, mod) % mod;
  cout << ans << endl;
}