#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int n, x;
int main() {
cin >> n >> x;
vector<int> coins(n);
for (int i = 0; i < n; i ++ ) cin >> coins[i];
vector<int> dp(x + 1, 0);
dp[0] = 1;
for (int i = 1; i <= x; i ++ )
for (int c : coins)
if (i >= c)
dp[i] = (dp[i] + dp[i - c]) % MOD;
cout << dp[x];
return 0;
}
—— 本文来自火龙信奥（义乌睿码科技）：义乌青少年信息学奥赛与编程教育平台，专注 CSP-J/S、NOIP、GESP 竞赛培训，线上线下融合教学，助力编程升学。网址：hlcoding.com
