#include <bits/stdc++.h>   using namespace std;   const int inf = 109;   const int mod = 1000000007;   long long cnt[inf];   long long dp[inf];   long long temp[inf][inf];   long long sol[inf][inf];   long long bs[inf][inf];   int main() {     int n, x, a;     scanf( %d%d , &n, &x);     for (int i = 0; i < n; ++i) {       scanf( %d , &a);       cnt[a]++;     }     dp[0] = 1;     int all = 0;     for (int i = 1; i <= 100; ++i) {       for (int j = 1; j <= i; ++j) dp[i] = (dp[i] + dp[i - j] * cnt[j]) % mod;       all = (all + dp[i]) % mod;     }     dp[0] = all;     for (int i = 1; i <= 50; ++i) swap(dp[i], dp[101 - i]);     for (int i = 1; i <= 100; ++i) sol[i][i] = 1, bs[0][i] = bs[1][i] = cnt[i];     sol[0][0] = bs[0][0] = 1;     for (int i = 2; i <= 100; ++i) bs[i][i - 1] = 1;     if (x <= 100) {       int ad = 0;       for (int i = 100; i > 0 && x > 0; --i, --x) ad = (ad + dp[i]) % mod;       printf( %d n , ad + 1);       return 0;     }     x -= 100;     while (x) {       if (x & 1) {         for (int i = 0; i <= 100; ++i)           for (int j = 0; j <= 100; ++j) {             temp[i][j] = 0;             for (int u = 0; u <= 100; ++u)               temp[i][j] = (temp[i][j] + sol[i][u] * bs[u][j]) % mod;           }         for (int i = 0; i <= 100; ++i)           for (int j = 0; j <= 100; ++j) sol[i][j] = temp[i][j];       }       x = x >> 1;       for (int i = 0; i <= 100; ++i)         for (int j = 0; j <= 100; ++j) {           temp[i][j] = 0;           for (int u = 0; u <= 100; ++u)             temp[i][j] = (temp[i][j] + bs[i][u] * bs[u][j]) % mod;         }       for (int i = 0; i <= 100; ++i)         for (int j = 0; j <= 100; ++j) bs[i][j] = temp[i][j];     }     int ans = 0;     for (int i = 0; i <= 100; ++i) ans = (ans + sol[0][i] * dp[i]) % mod;     printf( %d n , (ans + 1) % mod);   }   