#include <bits/stdc++.h>
using namespace std;
const int li = 100;
const int maxn = 105;
const int mod = 1000000007;
int n, x, cnt[maxn], dp[maxn], num;
struct mat {
  int data[maxn][maxn];
  void one() {
    init();
    for (int i = 0; i < num; i++) data[i][i] = 1;
  }
  inline void init() { memset(data, 0, sizeof(data)); }
  void out() {
    for (int i = 0; i < num; i++) {
      for (int j = 0; j < num; j++) {
        printf("%d%c", data[i][j], j == num - 1 ? '\n' : ' ');
      }
    }
  }
} st;
mat copy(const mat& a) {
  mat c;
  for (int i = 0; i < num; i++)
    for (int j = 0; j < num; j++) c.data[i][j] = a.data[i][j];
  return c;
}
mat operator*(const mat& a, const mat& b) {
  mat c;
  c.init();
  for (int k = 0; k < num; k++) {
    for (int i = 0; i < num; i++) {
      if (!a.data[i][k]) continue;
      for (int j = 0; j < num; j++)
        c.data[i][j] =
            ((long long)a.data[i][k] * b.data[k][j] + c.data[i][j]) % mod;
    }
  }
  return c;
}
mat operator+(const mat& a, const mat& b) {
  mat c;
  for (int i = 0; i < num; i++)
    for (int j = 0; j < num; j++)
      c.data[i][j] = (a.data[i][j] + b.data[i][j]) % mod;
  return c;
}
mat operator^(const mat& aa, int k) {
  mat a = copy(aa);
  mat c;
  c.one();
  for (; k; k >>= 1) {
    if (k & 1) c = c * a;
    a = a * a;
  }
  return c;
}
void sol() {
  if (x > li) {
    for (int i = 1; i <= li; i++) {
      for (int j = 1; j <= i; j++)
        dp[i] = (dp[i] + (long long)cnt[j] * dp[i - j]) % mod;
    }
    num = 101;
    st.init();
    int s = 0;
    st.data[li][li] = 1;
    for (int i = 0; i <= li; i++) s = (s + dp[i]) % mod;
    dp[num] = s;
    for (int i = 0; i < 99; i++) st.data[i][i + 1] = 1;
    for (int i = 0; i < 100; i++)
      st.data[99][i] = st.data[100][i] = cnt[100 - i];
    st = st ^ (x - li);
    int r = 0;
    for (int i = 0; i < num; i++)
      r = (r + (long long)dp[i + 1] * st.data[li][i]) % mod;
    printf("%d\n", r);
  } else {
    for (int i = 1; i <= x; i++) {
      for (int j = 1; j <= i; j++)
        dp[i] = (dp[i] + (long long)cnt[j] * dp[i - j]) % mod;
    }
    int s = 0;
    for (int i = 0; i <= x; i++) s = (s + dp[i]) % mod;
    printf("%d\n", s);
  }
}
int main() {
  int a;
  scanf("%d%d", &n, &x);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a);
    cnt[a]++;
  }
  dp[0] = 1;
  sol();
}
