https://codeforces.com/problemset/problem/632/E

题解：将所有元素减去最小元素

再进行完全背包

如果体积超过k则不可以。

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=1000000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int ans,cnt,flag,temp;
int a[N];
int dp[N];
char str;
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    sort(a+1,a+n+1);
    int l=a[1];
    for(int i=1;i<=n;i++)
        a[i]-=l;
    int r=a[n]*m;
     for(int i=0;i<=r;i++)
        dp[i]=INF;
    dp[0]=0;
    for(int i=1;i<=n;i++){
        if(a[i]==0||a[i-1]==a[i])
            continue;
        for(int j=0;j+a[i]<=r;j++){
            dp[j+a[i]]=min(dp[j]+1,dp[j+a[i]]);
        }
    }
    for(int i=0;i<=r;i++)
        if(dp[i]<=m)
            printf("%d ",l*m+i);
    //cout << "Hello world!" << endl;
    return 0;
}