A. Points in Segments

501div.3

A. Points in Segments

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a set of n

segments on the axis Ox, each segment has integer endpoints between 1 and m inclusive. Segments may intersect, overlap or even coincide with each other. Each segment is characterized by two integers li and ri (1≤li≤ri≤m

) — coordinates of the left and of the right endpoints.

Consider all integer points between 1

and m inclusive. Your task is to print all such points that don't belong to any segment. The point x belongs to the segment [l;r] if and only if l≤x≤r

.

Input

The first line of the input contains two integers n

and m (1≤n,m≤100

) — the number of segments and the upper bound for coordinates.

The next n

lines contain two integers each li and ri (1≤li≤ri≤m) — the endpoints of the i-th segment. Segments may intersect, overlap or even coincide with each other. Note, it is possible that li=ri

, i.e. a segment can degenerate to a point.

Output

In the first line print one integer k

— the number of points that don't belong to any segment.

In the second line print exactly k

integers in any order — the points that don't belong to any segment. All points you print should be distinct.

If there are no such points at all, print a single integer 0

in the first line and either leave the second line empty or do not print it at all.

Examples

Input

Copy

3 5
2 2
1 2
5 5

Output

Copy

2
3 4 

Input

Copy

1 7
1 7

Output

Copy

0

Note

In the first example the point 1

belongs to the second segment, the point 2 belongs to the first and the second segments and the point 5 belongs to the third segment. The points 3 and 4

do not belong to any segment.

In the second example all the points from 1

to 7 belong to the first segment.

 

题目大意：

输入n，m

然后有n行li，ri，li<ri

在自然数1到m的中，除去n行li，ri里的数，包括li，ri

如果没有剩余的数字，输出0

否者输出剩余数字的个数，再输出剩余的数字

 

思路：

数组a存下从1到m的自然数

然后n行输入，将a数组中li到ri的数全部赋值为0

如果数组a全部为0 输出0

否则就输出剩余的非0数字即可

 

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,m,i,x,y;
    int a[105];
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int t=0;
        memset(a,0,sizeof(a));
        for(i=1;i<=m;i++) a[i]=i;
        for(i=1;i<=n;i++)
        {
            cin>>x>>y;
            for(int j=x;j<=y;j++)
                a[j]=0;
        }
        for(i=1;i<=m;i++)
        {
            if(a[i]!=0)
            ++t;
        }
        if(t==0)cout<<t<<endl;
        else
        {
            cout<<t<<endl;
        for(i=1;i<=m;i++)
        {
            if(a[i]!=0)
           cout<<a[i]<<" ";
        }
        cout<<endl;
        }
    }
    return 0;
}