usaco Money Systems

/*
ID:yueqi
LANG:C++
TASK:money
*/
#include <set>
#include <map>
#include <ctime>
#include <queue>
#include <cmath>
#include <stack>
#include <limits.h>
#include <vector>
#include <bitset>
#include <string>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <string.h>
#include <iostream>
#include <algorithm>
#define Si set<int>
#define LL long long
#define pb push_back
#define PS printf(" ")
#define Vi vector<int>
#define LN printf("\n")
#define lson l,m,rt << 1
#define rson m+1,r,rt<<1|1
#define SD(a) scanf("%d",&a)
#define PD(a) printf("%d",a)
#define SET(a,b) memset(a,b,sizeof(a))
#define FF(i,a) for(int i(0);i<(a);i++)
#define FD(i,a) for(int i(a);i>=(1);i--)
#define FOR(i,a,b) for(int i(a);i<=(b);i++)
#define FOD(i,a,b) for(int i(a);i>=(b);i--)
#define readf freopen("money.in","r",stdin)
#define writef freopen("money.out","w",stdout)
const int maxn = 10005;
const long long BigP=999983;
const long long  INF = 0x5fffffff;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
const double pi = acos(-1.0);
const double eps= 1e-7;
using namespace std;
int N,V,a[26];
LL dp[10001];
int main()
{
readf;
writef;
dp[0]=1;
SD(V);SD(N);
FOR(i,1,V) SD(a[i]);
FOR(i,1,V) FOR(j,a[i],N){
dp[j]+=dp[j-a[i]];
}
printf("%lld\n",dp
);
return 0;
}