#include <iostream>
#include <algorithm>
#include <stack>
using namespace std;
#define MAX 100005
int a[MAX];
stack<int> s;

int main(){
	int n, k, tmp, f, maxt = 0, maxa = 0;
	while(cin >> n >> k, n){
		fill(a, a+MAX, MAX+1);
		for(int i = 0;i < k;i++){cin >> tmp;a[i] = tmp;}
		sort(a, a+MAX);
		f = !a[0];tmp = a[f]-1;
		for(int i = f;i < k+1;i++){
			if(tmp+1 != a[i]){
				maxa = max(maxa, maxt);
				s.push(maxt);
				if(a[i-1]+2 == a[i])s.push(-1);
				else s.push(-2);
				maxt = 0;
			}
			tmp = a[i];maxt++;
		}
		if(!f){cout << maxa << endl;continue;}
		s.pop();maxt = s.top();s.pop();
		while(!s.empty()){
			if(s.top() == -1){
				s.pop();
				int g = s.top();
				maxa = max(maxa, maxt+g+1);
			}else s.pop();
			maxt = s.top();s.pop();
		}
		cout << maxa << endl;
	}
	return 0;
}
### Prompt

Your task is to create 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 <algorithm>
#include <stack>
using namespace std;
#define MAX 100005
int a[MAX];
stack<int> s;

int main(){
	int n, k, tmp, f, maxt = 0, maxa = 0;
	while(cin >> n >> k, n){
		fill(a, a+MAX, MAX+1);
		for(int i = 0;i < k;i++){cin >> tmp;a[i] = tmp;}
		sort(a, a+MAX);
		f = !a[0];tmp = a[f]-1;
		for(int i = f;i < k+1;i++){
			if(tmp+1 != a[i]){
				maxa = max(maxa, maxt);
				s.push(maxt);
				if(a[i-1]+2 == a[i])s.push(-1);
				else s.push(-2);
				maxt = 0;
			}
			tmp = a[i];maxt++;
		}
		if(!f){cout << maxa << endl;continue;}
		s.pop();maxt = s.top();s.pop();
		while(!s.empty()){
			if(s.top() == -1){
				s.pop();
				int g = s.top();
				maxa = max(maxa, maxt+g+1);
			}else s.pop();
			maxt = s.top();s.pop();
		}
		cout << maxa << endl;
	}
	return 0;
}
```