#include <bits/stdc++.h>
#define ll long long
using namespace std;
namespace IO{
  inline char ch(){
    static char s[1<<16],*S,*T;
    return (S == T)&&(T = (S = s)+
      fread(s,1,1<<16,stdin),S == T)?EOF:*S++;
  }
  template<typename T> void read(T &x){
    x = 0; int f(1); char c = ch();
    for(;!isdigit(c);c = ch()) if(c == '-') f = -1;
    for(;isdigit(c);c = ch()) x = x*10+c-'0';
    x *= f;
  }
  template<typename T,typename... Args>
  inline void read(T &x,Args&... args){
    read(x); read(args...);
  }
  template<typename T> void write(T x,char f = '\n'){
    if(x < 0) putchar('-'),x = -x;
    if(x > 9) write(x/10,'\0');
    putchar('0'+x%10);
    if(f != '\0') putchar(f);
  }
}
using namespace IO;
const int maxn = 103;
int n; ll A[maxn],X;
ll dp[2][maxn][maxn];
int main(){
#ifdef LZX_CAI
  freopen("test.in","r",stdin);
  freopen("test.out","w",stdout);
#endif
  read(n,X);
  for(int i(1);i <= n;++i) read(A[i]);
  ll Ans = 1e18;
  for(int d(1);d <= n;++d){
    int x = X%d;
    for(int i(0);i <= d;++i)
      for(int j(0);j < d;++j)
        dp[0][i][j] = -1e14;
    dp[0][0][0] = 0;
    for(int i(1);i <= n;++i){
      int nw = (i&1);
      for(int i(0);i <= min(i,d);++i)
        for(int j(0);j < d;++j)
          dp[nw][i][j] = -1e14;
      for(int j(0);j <= min(i,d);++j)
        for(int k(0);k < d;++k){
          int x = A[i]%d;
          if(j > 0) dp[nw][j][k] = max(dp[nw][j][k],dp[nw^1][j-1][(k-x+d)%d]+A[i]);
          dp[nw][j][k] = max(dp[nw][j][k],dp[nw^1][j][k]);
        }
    }
    if(dp[n&1][d][x] > 0){
      ll tm = (X-dp[n&1][d][x])/d;
      Ans = min(Ans,tm);
    }
  }
  cout << Ans << endl;
  return 0;
}
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << '\n'; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

template<ll MOD = 1000000007>
class ModInt {
    ll n;
    ModInt constexpr inverse() const {
        return ModInt::pow(*this, MOD - 2);
    }

public:
    ModInt() : n(0) {}
    ModInt(ll _n) : n(((_n % MOD) + MOD) % MOD) {}
    ModInt operator+=(const ModInt &m) {
        n += m.n;
        if (n >= MOD) n -= MOD;
        return *this;
    }
    ModInt operator-=(const ModInt &m) {
        n -= m.n;
        if (n < 0) n += MOD;
        return *this;
    }
    ModInt operator*=(const ModInt &m) {
        n *= m.n;
        if (n >= MOD) n %= MOD;
        return *this;
    }
    ModInt operator/=(const ModInt &m) {
        (*this) *= m.inverse();
        return *this;
    }
    friend ModInt operator+(ModInt t, const ModInt &m) {
        return t += m;
    }
    friend ModInt operator-(ModInt t, const ModInt &m) {
        return t -= m;
    }
    friend ModInt operator*(ModInt t, const ModInt &m) {
        return t *= m;
    }
    friend ModInt operator/(ModInt t, const ModInt &m) {
        return t /= m;
    }
    ModInt operator=(const ll l) {
        n = l % MOD;
        if (n < 0) n += MOD;
        return *this;
    }
    friend ostream &operator<<(ostream &out, const ModInt &m) {
        out << m.n;
        return out;
    }
    friend istream &operator>>(istream &in, ModInt &m) {
        ll l;
        in >> l;
        m = l;
        return in;
    }
    static constexpr ModInt pow(const ModInt x, ll p) {
        ModInt<MOD> ans = 1;
        for (ModInt<MOD> m = x; p > 0; p /= 2, m *= m) {
            if (p % 2) ans *= m;
        }
        return ans;
    }
};
using mint = ModInt<998244353>;
mint operator"" _m(unsigned long long m) {
    return mint(m);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m, k;
    cin, n, m, k;
    mint ans = 0;
    if (n == 1 || m == 1) {
        print(mint::pow(k, m * n));
        return 0;
    }
    rep(i, 0, k) {
        mint a = mint::pow(k - i, m) - mint::pow(k - i - 1, m);
        ans += a * mint::pow(i + 1, n);
        // dump(ans, a);
    }
    print(ans);
    return 0;
}
