Codeforces Round #346 (Div. 2) - C Tanya and Toys

C. 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 of10⁹ types of toys, numbered with integers from1 to 10⁹. A toy from the new collection of thei-th type costs i bourles.

Tania has managed to collect n different types of toys a₁, a₂, ..., a_n 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⁹) — 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 integersa₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹) — 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 exceedm.

In the second line print k distinct space-separated integerst₁, t₂, ..., t_k (1 ≤ t_i ≤ 10⁹) — the types of toys that Tanya should choose.

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

Examples

Input

3 71 3 4

Output

22 5 

Input

4 144 6 12 8

Output

47 2 3 1

Note

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

题意：给出已有的n个玩具编号，m的钱；问能最多买多少个玩具，玩具编号不能重复。

分析：sort一遍，一次找就行，水~

<span style="font-size:18px;">#include <iostream>#include <cstdio>#include <cstring>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <cmath>#include <algorithm>using namespace std;const double eps = 1e-6;const double pi = acos(-1.0);const int INF = 0x3f3f3f3f;const int MOD = 1000000007;#define ll long long#define CL(a,b) memset(a,b,sizeof(a))#define lson (i<<1)#define rson ((i<<1)|1)#define MAXN 100010int a[MAXN],s[MAXN];int main(){    int n,m;    while(~scanf("%d%d",&n,&m))    {        for(int i=0; i<n; i++)            cin>>a[i];        sort(a, a+n);        int ans,t,k;        ans = 0;        t = k = 0;        for(int i=1; ; i++)        {            if(i == a[k]){k++; continue;}            if(m >= i)            {                m -= i;                s[t++] = i;                ans++;            }            else break;        }        cout<<ans<<endl;        for(int i=0; i<t; i++)            cout<<" "<<s[i];        cout<<endl;    }    return 0;}</span>