Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Alyona and mex

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAlyona's mother wants to present an array of *n* non-negative integers to Alyona. The array should be special.

Alyona is a capricious girl so after she gets the array, she inspects *m* of its subarrays. Subarray is a set of some subsequent elements of the array. The *i*-th subarray is described with two integers *l* _{ i} and *r* _{ i}, and its elements are *a*[*l* _{ i}], *a*[*l* _{ i} + 1], ..., *a*[*r* _{ i}].

Alyona is going to find mex for each of the chosen subarrays. Among these *m* mexes the girl is going to find the smallest. She wants this minimum mex to be as large as possible.

You are to find an array *a* of *n* elements so that the minimum mex among those chosen by Alyona subarrays is as large as possible.

The mex of a set *S* is a minimum possible non-negative integer that is not in *S*.

Input

The first line contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 10^{5}).

The next *m* lines contain information about the subarrays chosen by Alyona. The *i*-th of these lines contains two integers *l* _{ i} and *r* _{ i} (1 ≤ *l* _{ i} ≤ *r* _{ i} ≤ *n*), that describe the subarray *a*[*l* _{ i}], *a*[*l* _{ i} + 1], ..., *a*[*r* _{ i}].

Output

In the first line print single integer — the maximum possible minimum mex.

In the second line print *n* integers — the array *a*. All the elements in *a* should be between 0 and 10^{9}.

It is guaranteed that there is an optimal answer in which all the elements in *a* are between 0 and 10^{9}.

If there are multiple solutions, print any of them.

Examples

Input

5 3

1 3

2 5

4 5

Output

2

1 0 2 1 0

Input

4 2

1 4

2 4

Output

3

5 2 0 1

Note

The first example: the mex of the subarray (1, 3) is equal to 3, the mex of the subarray (2, 5) is equal to 3, the mex of the subarray (4, 5) is equal to 2 as well, thus the minumal mex among the subarrays chosen by Alyona is equal to 2.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/12/2020 02:22:41 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|