#include<cstdio>
#include<string>
#include<vector>
#include<sstream>
#include<deque>
#include<algorithm>
#include<queue>

using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define reps(i,n) for(int i=1;i<=n;i++)

int dp[2][100001];
int masu[100001];
int main(){
	while(1){
		rep(i,2)rep(j,100001){
			dp[i][j]=0;
		}
		rep(j,100001){
			masu[j]=0;
		}
		
		int n,m;
		scanf("%d%d",&n,&m);
		if(n==0)break;
		
		int fflg=0;
		rep(i,m){
			int a;
			scanf("%d",&a);
			if(a==0){
				fflg=1;
				continue;
			}
			
			masu[a]=1;
		}
		
		reps(i,n){
			if(masu[i]==1){
				dp[0][i]=dp[0][i-1]+1;
			}
		}
		
		reps(i,n){
			if(masu[i]==1){
				dp[1][i]=dp[1][i-1]+1;
			}else{
				dp[1][i]=dp[0][i-1]+1;
			}
		}
		
		int maxi=-1;
		reps(i,n){
			maxi=max(maxi,dp[fflg][i]);
		}
		
		printf("%d\n",maxi);
	}
	
}
### Prompt

Your challenge is to write 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<cstdio>
#include<string>
#include<vector>
#include<sstream>
#include<deque>
#include<algorithm>
#include<queue>

using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define reps(i,n) for(int i=1;i<=n;i++)

int dp[2][100001];
int masu[100001];
int main(){
	while(1){
		rep(i,2)rep(j,100001){
			dp[i][j]=0;
		}
		rep(j,100001){
			masu[j]=0;
		}
		
		int n,m;
		scanf("%d%d",&n,&m);
		if(n==0)break;
		
		int fflg=0;
		rep(i,m){
			int a;
			scanf("%d",&a);
			if(a==0){
				fflg=1;
				continue;
			}
			
			masu[a]=1;
		}
		
		reps(i,n){
			if(masu[i]==1){
				dp[0][i]=dp[0][i-1]+1;
			}
		}
		
		reps(i,n){
			if(masu[i]==1){
				dp[1][i]=dp[1][i-1]+1;
			}else{
				dp[1][i]=dp[0][i-1]+1;
			}
		}
		
		int maxi=-1;
		reps(i,n){
			maxi=max(maxi,dp[fflg][i]);
		}
		
		printf("%d\n",maxi);
	}
	
}
```