Tanya and Toys （CodeForces - 659C）贪心（从1开始取不包括已给数据，和小于等于m，最多能取多少）

                                                      Tanya and Toys

                                                                        time limit per test 1 second

                                                                memory limit per test 256 megabytes

                                                                              input standard input

                                                                            output standard output

In Berland recently a new collection of toys went on sale. This collection consists of 109 types of toys, numbered with integers from 1 to 109. A toy from the new collection of the i-th type costs i bourles.

Tania has managed to collect n different types of toys a1, a2, ..., an from the new collection. Today is Tanya's birthday, and her mother decided to spend no more than m bourles on the gift to the daughter. Tanya will choose several different types of toys from the new collection as a gift. Of course, she does not want to get a type of toy which she already has.

Tanya wants to have as many distinct types of toys in her collection as possible as the result. The new collection is too diverse, and Tanya is too little, so she asks you to help her in this.

Input

The first line contains two integers n (1 ≤ n ≤ 100 000) and m (1 ≤ m ≤ 10^9) — the number of types of toys that Tanya already has and the number of bourles that her mom is willing to spend on buying new toys.

The next line contains n distinct integers a1, a2, ..., an (1 ≤ ai ≤ 10^9) — the types of toys that Tanya already has.

Output

In the first line print a single integer k — the number of different types of toys that Tanya should choose so that the number of different types of toys in her collection is maximum possible. Of course, the total cost of the selected toys should not exceed m.

In the second line print k distinct space-separated integers t1, t2, ..., tk (1 ≤ ti ≤ 10^9) — the types of toys that Tanya should choose.

If there are multiple answers, you may print any of them. Values of ti can be printed in any order.

Examples

input

3 7
1 3 4

output

2
2 5 

input

4 14
4 6 12 8

output

4
7 2 3 1

Note

In the first sample mom should buy two toys: one toy of the 2-nd type and one toy of the 5-th type. At any other purchase for 7 bourles (assuming that the toys of types 1, 3 and 4 have already been bought), it is impossible to buy two and more toys.

题解

题意简单来说就是：小明喜欢收集手办（咳咳），他现在有n个，准备再买一些，手办的序号和价格一样，从1- 1e9，他现在有m元，问他最多还能买多少个，序号是多少。

我一开始是想打表记录，全部标为0，然后把已有的标为1，从a1开始遍历，如果ai为0，就用m-ai，购买个数mark+1，把买到的存到b数组，最后输出。提交的时候wa了orz。。。我很懵，就换了一种写法，数组a存已有的手办编号，从1开始遍历，如果不为a中已有的，就用m-ai，购买个数mark+1，把买到的存到b数组，最后输出。ac。。。然后我返回去看了一眼，范围10^9我看成了109，然后数组就定了110（这哪里够啊喂！肯定会wa的好么！）。。这么大肯定是会爆的。。。就不考虑了。所以说题上给的数据很！重！要！再大再不好看也得要！

因为是问最多能买多少个，所以从1开始找最小的减就行了，典型的贪心，不用管他钱剩多少，是不是最大限度的用完（像第二个例子。。并没有必要），剩下多还能买个奶昔解暑不是

# include <cstdio>
# include <algorithm>
# include <cstring>

using namespace std;
const int maxn = 1e5 + 10;

int main()
{
	int a[maxn], b[maxn];
	int n, m;
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++) scanf("%d",&a[i]);
	
	sort(a,a+n);
	int mark = 0, num = 0;
	for(int i=1;;i++)
	{
		if(a[num] == i) 
		{
			num++;
			continue;
		}
		
		else if(m>=i)
		{
			b[mark++] = i;
			m -= i;
		}
		
		else if(m<i) break;
	}
	printf("%d\n",mark);
	for(int i=0;i<mark;i++) printf("%d ",b[i]);
	
	printf("\n");
	return 0;
 }