CodeForces 687C The Values You Can Make

Description

Pari wants to buy an expensive chocolate from Arya. She has n coins, the value of the i-th coin is c_i. The price of the chocolate is k, so Pari will take a subset of her coins with sum equal to k and give it to Arya.

Looking at her coins, a question came to her mind: after giving the coins to Arya, what values does Arya can make with them? She is jealous and she doesn't want Arya to make a lot of values. So she wants to know all the values x, such that Arya will be able to make x using some subset of coins with the sum k.

Formally, Pari wants to know the values x such that there exists a subset of coins with the sum k such that some subset of this subset has the sum x, i.e. there is exists some way to pay for the chocolate, such that Arya will be able to make the sum x using these coins.

Input

The first line contains two integers n and k (1  ≤  n, k  ≤  500) — the number of coins and the price of the chocolate, respectively.

Next line will contain n integers c₁, c₂, ..., c_n (1 ≤ c_i ≤ 500) — the values of Pari's coins.

It's guaranteed that one can make value k using these coins.

Output

First line of the output must contain a single integer q— the number of suitable values x. Then print q integers in ascending order — the values that Arya can make for some subset of coins of Pari that pays for the chocolate.

Sample Input

Input

6 18
5 6 1 10 12 2

Output

16
0 1 2 3 5 6 7 8 10 11 12 13 15 16 17 18 

Input

3 50
25 25 50

Output

3
0 25 50 

题意：

给出n个数，从中任选，使其和等于k，问选出的这些数的子集能出现的和有多少个？

题解：
dp[i][j]表示当前的和为i，和为j的情况可不可能出现，所以对于每个数ai，当i>ai时，此时的和可以是i-ai，

所以状态转移为dp[i][j]=dp[i][j]||dp[i-ai][j]:当j>ai时，此时除了上面一种转移之外，还有另一个转移方法此时和为i-ai，j为j-ai。

dp[i][j]=dp[i][j]||dp[i-ai][j-ai],因为j不可能比i大，所以当i>ai时，无法判断j和ai的大小关系，假设ai>j，此时不能把ai选入。因为我们假设子集的和为j。

加入的这个数，比我们假设的和都大，这不合理。

代码：

#include<cstring>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<fstream>
#include <algorithm>
#include <vector>
#include <cmath>
#define M 20000
using namespace std;
vector<int> ans;
int n,m;
int c[M];
int dp[505][505];
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=1;i<=n;i++)
            scanf("%d",&c[i]);
            memset(dp,0,sizeof(dp));
            dp[0][0]=1;
            for(int i=1;i<=n;i++)
            {
                for(int j=m;j>=0;j--)
                    for(int k=j;k>=0;k--)
                {
                    if(j>=c[i])
                        dp[j][k]=dp[j][k]||dp[j-c[i]][k];
                    if(k>=c[i])
                        dp[j][k]=dp[j][k]||dp[j-c[i]][k-c[i]];
                }
            }
            for(int i=0;i<=m;i++)
                if(dp[m][i])
                ans.push_back(i);
            cout<<ans.size()<<endl;
            for(int i=0;i<ans.size();i++)
            {
                if(ans.size()==i-1)
                    cout<<ans[i]<<endl;
                else
                    cout<<ans[i]<<" ";
            }

    }
    return 0;
}