#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
  int n,k;
  int i,cnt,max;
  vector<int>card,num;
  while(cin>>n>>k,n|k){
    card.resize(k);
    num.clear();

    for(i=0;i<k;i++)cin>>card[i];
    sort(card.begin(),card.end());

    cnt=1;
    for(i=0;i<card.size()-1;i++){
      if(card[0]==0&&i==0)continue;
      if(card[i+1]==card[i]+1){
	cnt++;
      }else{
	num.push_back(cnt);
	if(card[i+1]>card[i]+2)num.push_back(0);
	cnt=1;
      }
    }
    num.push_back(cnt);
    if(card[i]<n)num.push_back(0);

    max=0;
    for(i=0;i<num.size();i++)if(max<num[i])max=num[i];
    if(card[0]==0){
      for(i=0;i<num.size()-1;i++){
	if(num[i]!=0&&num[i+1]==0&&max<num[i]+1)max=num[i]+1;
      }
      for(i=num.size();--i>1;){
	if(num[i]!=0&&num[i-1]==0&&max<num[i]+1)max=num[i]+1;
      }
      for(i=0;i<num.size()-1;i++){
	if(num[i]!=0&&num[i+1]!=0&&max<num[i]+num[i+1]+1)max=num[i]+num[i+1]+1;
      }
    }
    cout<<max<<endl;
  }
}
### Prompt

Construct a cpp code solution to the problem outlined:

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;
  int i,cnt,max;
  vector<int>card,num;
  while(cin>>n>>k,n|k){
    card.resize(k);
    num.clear();

    for(i=0;i<k;i++)cin>>card[i];
    sort(card.begin(),card.end());

    cnt=1;
    for(i=0;i<card.size()-1;i++){
      if(card[0]==0&&i==0)continue;
      if(card[i+1]==card[i]+1){
	cnt++;
      }else{
	num.push_back(cnt);
	if(card[i+1]>card[i]+2)num.push_back(0);
	cnt=1;
      }
    }
    num.push_back(cnt);
    if(card[i]<n)num.push_back(0);

    max=0;
    for(i=0;i<num.size();i++)if(max<num[i])max=num[i];
    if(card[0]==0){
      for(i=0;i<num.size()-1;i++){
	if(num[i]!=0&&num[i+1]==0&&max<num[i]+1)max=num[i]+1;
      }
      for(i=num.size();--i>1;){
	if(num[i]!=0&&num[i-1]==0&&max<num[i]+1)max=num[i]+1;
      }
      for(i=0;i<num.size()-1;i++){
	if(num[i]!=0&&num[i+1]!=0&&max<num[i]+num[i+1]+1)max=num[i]+num[i+1]+1;
      }
    }
    cout<<max<<endl;
  }
}
```