B"Alyona'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 li and ri, and its elements are a[li], xe2 x80 x89a[li xe2 x80 x89+ xe2 x80 x891], xe2 x80 x89..., xe2 x80 x89a[ri]. 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. The first line contains two integers n and m (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105). The next m lines contain information about the subarrays chosen by Alyona. The i-th of these lines contains two integers li and ri (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89li xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ri xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n), that describe the subarray a[li], xe2 x80 x89a[li xe2 x80 x89+ xe2 x80 x891], xe2 x80 x89..., xe2 x80 x89a[ri]. 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 109. It is guaranteed that there is an optimal answer in which all the elements in a are between 0 and 109. If there are multiple solutions, print any of them. The first example: the mex of the subarray (1, xe2 x80 x893) is equal to 3, the mex of the subarray (2, xe2 x80 x895) is equal to 3, the mex of the subarray (4, xe2 x80 x895) is equal to 2 as well, thus the minumal mex among the subarrays chosen by Alyona is equal to 2. "...