#include <iostream> 
#include <cstring>
using namespace std;
int n, m, MAX = 0, answer = 0;
int Weight[21];
int F[20001];
bool judge[21];
int Find()//判断每一种重量是否存在，因为所产生的所有的值只可能是1~maxx之间的数
{
    int total = 0;
    memset(F, 0, sizeof(F));
    F[0] = 1;
    for (int i = 1; i <= n; i++)
    {
        if (!judge[i])
        {
            for (int j = MAX; j >= Weight[i]; j--)
            {
                F[j] += F[j - Weight[i]];
            }
        }
    }
    for (int i = 1; i <= MAX; i++)
    {
        if (F[i])
        {
            total++;
        }
    }
    answer = max(answer, total);
}
void Search(int counts, int pos)
{
    if (counts == m + 1)
    {
        Find();
    }
    else
    {
        if (pos > n)
        {
            return ;//从1~n来一遍
        }
        judge[pos] = true;
        Search(counts + 1, pos + 1);//某一个数字在组合的过程中只有两种可能，一种是选，一种是不选，所以会出现两种情况，故搜两次
        judge[pos] = false;
        Search(counts, pos + 1);
    }
}
int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> Weight[i];
        MAX += Weight[i];//计算出总重量
    }
    if (m == 0)
    {
        Find();
    }
    Search(1, 1);
    cout << answer << endl;
}