codeforces659C

Tanya and Toys

 CodeForces - 659C 

In Berland recently a new collection of toys went on sale. This collection consists of 10⁹ types of toys, numbered with integers from 1 to 10⁹. A toy from the new collection of the i-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 integers a₁, 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 exceed m.

In the second line print k distinct space-separated integers t₁, 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 of t_i 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.

sol：XJB贪心，复杂度是有保证的，1e9到1e5的等差序列就炸了，所以O(枚举)一定是可行的

#include <bits/stdc++.h>
using namespace std;
typedef int ll;
inline ll read()
{
    ll s=0;
    bool f=0;
    char ch=' ';
    while(!isdigit(ch))
    {
        f|=(ch=='-'); ch=getchar();
    }
    while(isdigit(ch))
    {
        s=(s<<3)+(s<<1)+(ch^48); ch=getchar();
    }
    return (f)?(-s):(s);
}
#define R(x) x=read()
inline void write(ll x)
{
    if(x<0)
    {
        putchar('-'); x=-x;
    }
    if(x<10)
    {
        putchar(x+'0'); return;
    }
    write(x/10);
    putchar((x%10)+'0');
    return;
}
#define W(x) write(x),putchar(' ')
#define Wl(x) write(x),putchar('
')
const int N=100005;
int n,m,ans[N];
map<int,bool>Map;
int main()
{
    int i;
    R(n); R(m);
    for(i=1;i<=n;i++) Map[read()]=1;
    for(i=1;;i++) if(!Map[i])
    {
        if(m>=i)
        {
            ans[++*ans]=i; m-=i;
        }
        else break;
    }
    Wl((*ans));
    for(i=1;i<=*ans;i++) W(ans[i]);
    return 0;
}
/*
Input
3 7
1 3 4
Output
2
2 5 

Input
4 14
4 6 12 8
Output
4
7 2 3 1
*/