#include<stdio.h>
#include<vector>
#include<map>
using namespace std;
typedef pair<int,int> P;
vector<P> itv;
bool ap[100000];
int max(int a,int b){return a>b?a:b;}
int main(){
	int n,k;
	int i,j;
	while(1){
	bool white=false;
	scanf("%d %d",&n,&k);
	if(n==0)return 0;
	itv.clear();
	for(i=0;i<n;i++)ap[i]=false;
	for(i=0;i<k;i++){
		int x;
		scanf("%d",&x);
		if(x==0)white=true;
		else ap[x-1]=true;
	}
	for(i=0;i<n;i++){
		if(ap[i]){
			int s=i;
			while(i<n&&ap[i])i++;
			i--;
			itv.push_back(P(s,i));
		}
	}
	int ans=0;
	if(white){
		for(i=0;i<itv.size();i++){
			int len=itv[i].second-itv[i].first+1;
			if(i<itv.size()-1&&itv[i].second+2==itv[i+1].first){
				int nlen=itv[i+1].second-itv[i+1].first+1;
				ans=max(ans,len+nlen+1);
			}
			ans=max(ans,len+1);
		}
	}
	else{
		for(i=0;i<itv.size();i++)ans=max(ans,itv[i].second-itv[i].first+1);
	}
	printf("%d\n",ans);
	}
}
### Prompt

Create a solution in Cpp for 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<stdio.h>
#include<vector>
#include<map>
using namespace std;
typedef pair<int,int> P;
vector<P> itv;
bool ap[100000];
int max(int a,int b){return a>b?a:b;}
int main(){
	int n,k;
	int i,j;
	while(1){
	bool white=false;
	scanf("%d %d",&n,&k);
	if(n==0)return 0;
	itv.clear();
	for(i=0;i<n;i++)ap[i]=false;
	for(i=0;i<k;i++){
		int x;
		scanf("%d",&x);
		if(x==0)white=true;
		else ap[x-1]=true;
	}
	for(i=0;i<n;i++){
		if(ap[i]){
			int s=i;
			while(i<n&&ap[i])i++;
			i--;
			itv.push_back(P(s,i));
		}
	}
	int ans=0;
	if(white){
		for(i=0;i<itv.size();i++){
			int len=itv[i].second-itv[i].first+1;
			if(i<itv.size()-1&&itv[i].second+2==itv[i+1].first){
				int nlen=itv[i+1].second-itv[i+1].first+1;
				ans=max(ans,len+nlen+1);
			}
			ans=max(ans,len+1);
		}
	}
	else{
		for(i=0;i<itv.size();i++)ans=max(ans,itv[i].second-itv[i].first+1);
	}
	printf("%d\n",ans);
	}
}
```