#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main(){
	int n, k, i, j, num,cardsize, cnt, max, break_up;
	bool jk_flg;
	while(true){
		cin>>n>>k; if(n==0 && k==0)break;
		vector<bool> card(n+2, false);//+joker+end
		for(i=0;i<k;i++){
			cin>>num;
			card[num] = true;
		}
		max=0;
		i=1;
		cardsize=card.size() - 2;//=n
		while(i<cardsize){
			jk_flg = card[0];//joker
			cnt=0;
			if(card[i]==true){
				j=i;
				break_up=0;
				while(true){
					if(card[j]==true){
					}else if(jk_flg==true){
						break_up=j;
						jk_flg=false;
					}else{
						break;
					}
					cnt++;
					//cout<<"cnt="<<cnt<<"j="<<j<<endl;
					j++;
				}
				if(max<cnt) max=cnt;
				if(break_up==0) break_up=j;
				for(i=break_up; card[i]==false&&i<=cardsize; i++);
			}
			for( ; card[i]==false&&i<=cardsize; i++);
		}
		cout<<max<<endl;
	}
	return 0;
}
### Prompt

Generate a CPP solution to the following problem:

problem

There are n cards with one integer from 1 to n and one blank card. Of these n + 1 cards, k cards are given, but 1 ≤ k ≤ n. You can write one integer from 1 to n on a blank card. I want to make a continuous sequence of integers as long as possible with just a given card.

Write a program that outputs the maximum length of a contiguous sequence of integers that can be made from a given card when the given card is entered.



input

The input consists of multiple datasets. Each dataset is given in the following format. The input ends on a line containing two zeros.

On the first line, two integers n (1 ≤ n ≤ 100000) and k (1 ≤ k ≤ n) are written in this order, separated by one blank. The following k line contains one integer. Written one by one, representing the integers written on the given k cards. Blank cards are represented by 0.

Of the scoring data, 40% of the points are 1 ≤ n ≤ 1000, 1 ≤ k ≤ 500, 20% of the points are 1 ≤ n ≤ 60000, 1 ≤ k ≤ 50000. Satisfy 1 ≤ n ≤ 100000, 1 ≤ k ≤ 100000.

The number of datasets does not exceed 5.

output

Outputs an integer on one line for each dataset.

Examples

Input

7 5
6
2
4
7
1
7 5
6
2
0
4
7
0 0


Output

2
4


Input

None


Output

None

### Response

```cpp
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main(){
	int n, k, i, j, num,cardsize, cnt, max, break_up;
	bool jk_flg;
	while(true){
		cin>>n>>k; if(n==0 && k==0)break;
		vector<bool> card(n+2, false);//+joker+end
		for(i=0;i<k;i++){
			cin>>num;
			card[num] = true;
		}
		max=0;
		i=1;
		cardsize=card.size() - 2;//=n
		while(i<cardsize){
			jk_flg = card[0];//joker
			cnt=0;
			if(card[i]==true){
				j=i;
				break_up=0;
				while(true){
					if(card[j]==true){
					}else if(jk_flg==true){
						break_up=j;
						jk_flg=false;
					}else{
						break;
					}
					cnt++;
					//cout<<"cnt="<<cnt<<"j="<<j<<endl;
					j++;
				}
				if(max<cnt) max=cnt;
				if(break_up==0) break_up=j;
				for(i=break_up; card[i]==false&&i<=cardsize; i++);
			}
			for( ; card[i]==false&&i<=cardsize; i++);
		}
		cout<<max<<endl;
	}
	return 0;
}
```