#8 #9WA求助，为什么sort一下就过了

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#define N 25
using namespace std;
int n,m,a[N],f[N*100],t[N],ans,tot;
inline int read()
{
    int x,t=1;
    char c;
    while(c=getchar(),c<'0' || c>'9')  if(c=='-')  t=-1;
    x=c-'0';
    while(c=getchar(),c>='0' && c<='9')  x=x*10+c-'0';
    return x*t;
}
inline void solve()
{
    memset(f,0,sizeof(f));
    tot=0,f[0]=1;
    for(int i=1;i<=n;i++)
    {
        if(t[i])  continue;
        for(int j=2010;j>=0;j--)
            if(f[j] && !f[j+a[i]])
            {
                f[j+a[i]]=1;
                tot++;
            }
    }
    ans=max(ans,tot);
}
inline void dfs(int sum,int now)
{
    if(now>m)  return;
    if(sum==n)
    {
        if(now==m)  solve();
        return;
    }
    dfs(sum+1,now);
    t[sum]=1;
    dfs(sum+1,now+1);
    t[sum]=0;
}
int main()
{
    n=read(),m=read();
    for(int i=1;i<=n;i++)  a[i]=read();
    sort(a+1,a+1+n);
    dfs(1,0);
    cout<<ans;
    return 0;
}