Exactly Equal（NOIOPJENGLISH30）

Exactly Equal

https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH30

1000ms 65536K

描述：

Find a subset of N numbers. The sum of the numbers in the subset is exactly equal to T.

找到一个n个数的子集，使子集数之和等于t

输入：

First line: two positive integers N (N <= 100) and T (T <= 1000).
Second line: N positive integers (<= 1000).

第一行：两个正整数n和t

第二行：n个正整数

输出：

One line contains several numbers.

一行包含数个数字

样例输入：

5 10
2 4 5 9 3

样例输出：

2 5 3