#include <bits/stdc++.h>
using namespace std;
const int maxN = 109;
const long long MOD = (long long)1e9 + 7;
long long cnt[maxN];
struct Matrix {
  long long A[maxN][maxN];
  Matrix() {
    for (int i = 0; i < maxN; i++) {
      for (int j = 0; j < maxN; j++) {
        A[i][j] = 0;
      }
    }
  }
};
Matrix mult(Matrix a, Matrix b) {
  Matrix ans;
  for (int i = 0; i < maxN; i++) {
    for (int j = 0; j < maxN; j++) {
      for (int k = 0; k < maxN; k++) {
        ans.A[i][j] += a.A[i][k] * b.A[k][j];
        ans.A[i][j] %= MOD;
      }
    }
  }
  return ans;
}
Matrix binPow(Matrix c, int x) {
  Matrix ans;
  for (int i = 0; i < maxN; i++) {
    ans.A[i][i] = 1;
  }
  for (; x; x /= 2) {
    if (x & 1) {
      ans = mult(ans, c);
    }
    c = mult(c, c);
  }
  return ans;
}
int main() {
  int n, x;
  cin >> n >> x;
  while (n--) {
    int p;
    cin >> p;
    cnt[p]++;
  }
  Matrix a, b;
  for (int i = 2; i < maxN; i++) {
    a.A[i - 1][i] = 1;
  }
  for (int i = 1; i + 1 < maxN; i++) {
    a.A[i][1] = cnt[i];
  }
  a.A[0][0] = 1;
  a.A[1][0] = 1;
  b.A[0][1] = 1;
  cout << mult(b, binPow(a, x + 1)).A[0][0] << endl;
  return 0;
}
