#include <bits/stdc++.h>
using namespace std;

#define all(x) (x).begin(),(x).end()
#define SP <<" "<<
#define MOD 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000

typedef long long LL;
typedef long double LD;

int main(){
  while(1){
int n,k;
  cin >> n >> k;
  if(n==0) return 0;
  vector<int> a(n+2,0);
  int c;
  int z=0;
  for(int i=0;i<k;i++){
    cin >> c;
    if(c==0) z++;
    else a[c]++;
  }
  int ans=0;
  int aaa=0;
  int tmp=0;
  if(z){
    for(int i=1;i<=n;i++){
      if(a[i]==0){
        tmp=1;
        for(int j=i-1;j>=0;j--){
          if(a[j]==0) break;
          tmp++;
        }
        for(int j=i+1;j<=n;j++){
          if(a[j]==0) break;
          tmp++;
        }
        ans=max(ans,tmp);
        aaa=1;
      }
    }
    if(aaa) cout << ans << endl;
    else cout << n << endl;
  }else{
    for(int i=1;i<=n+1;i++){
      if(a[i]){
        tmp++;
      }else{
        ans=max(ans,tmp);
        tmp=0;
      }
    }
    cout << ans << endl;
  }
  }
  
  return 0;
}


### Prompt

In CPP, your task is to solve 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 <bits/stdc++.h>
using namespace std;

#define all(x) (x).begin(),(x).end()
#define SP <<" "<<
#define MOD 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000

typedef long long LL;
typedef long double LD;

int main(){
  while(1){
int n,k;
  cin >> n >> k;
  if(n==0) return 0;
  vector<int> a(n+2,0);
  int c;
  int z=0;
  for(int i=0;i<k;i++){
    cin >> c;
    if(c==0) z++;
    else a[c]++;
  }
  int ans=0;
  int aaa=0;
  int tmp=0;
  if(z){
    for(int i=1;i<=n;i++){
      if(a[i]==0){
        tmp=1;
        for(int j=i-1;j>=0;j--){
          if(a[j]==0) break;
          tmp++;
        }
        for(int j=i+1;j<=n;j++){
          if(a[j]==0) break;
          tmp++;
        }
        ans=max(ans,tmp);
        aaa=1;
      }
    }
    if(aaa) cout << ans << endl;
    else cout << n << endl;
  }else{
    for(int i=1;i<=n+1;i++){
      if(a[i]){
        tmp++;
      }else{
        ans=max(ans,tmp);
        tmp=0;
      }
    }
    cout << ans << endl;
  }
  }
  
  return 0;
}


```