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

#define PB push_back

int main(int argc,char* argv[]){
  int n,k,i,count,x,N;
  bool flag;
  int data[100001];
  vector<int> vec;

  while(cin>>n>>k){
    if(n==0 && k==0) break;

    flag=false;
    for(i=0;i<100001;i++) data[i]=0;
    vec.clear();
    count=0;

    
    for(i=0;i<k;i++){
      cin>>x;
      if(!x) flag=true;
      else data[x]=1;
    }
    

    for(i=1;i<=n;i++){
      if(data[i]==1){
	count++;
      }
      else if(i>1 && data[i]==0 && data[i-1]==0){
	vec.PB(0);
      }
      else if(data[i]==0){
	vec.PB(count);
	count=0;
      }
    }
    vec.PB(count);
    
    //ワイルドカードがある場合の処理
    if(flag){
      N=(int)vec.size();
      for(i=0;i<N-1;i++) vec.PB(vec[i]+vec[i+1]+1);
    }

    sort(vec.begin(),vec.end());

    cout<<vec.back()<<endl;
  }
  return 0;
}
### Prompt

Develop a solution in CPP to the problem described below:

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<cstdio>
#include<vector>
#include<algorithm>
using namespace std;

#define PB push_back

int main(int argc,char* argv[]){
  int n,k,i,count,x,N;
  bool flag;
  int data[100001];
  vector<int> vec;

  while(cin>>n>>k){
    if(n==0 && k==0) break;

    flag=false;
    for(i=0;i<100001;i++) data[i]=0;
    vec.clear();
    count=0;

    
    for(i=0;i<k;i++){
      cin>>x;
      if(!x) flag=true;
      else data[x]=1;
    }
    

    for(i=1;i<=n;i++){
      if(data[i]==1){
	count++;
      }
      else if(i>1 && data[i]==0 && data[i-1]==0){
	vec.PB(0);
      }
      else if(data[i]==0){
	vec.PB(count);
	count=0;
      }
    }
    vec.PB(count);
    
    //ワイルドカードがある場合の処理
    if(flag){
      N=(int)vec.size();
      for(i=0;i<N-1;i++) vec.PB(vec[i]+vec[i+1]+1);
    }

    sort(vec.begin(),vec.end());

    cout<<vec.back()<<endl;
  }
  return 0;
}
```