#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>

using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef complex<double> P;
static const double EPS = 1e-8;

#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)

int main(void){
  int n,k;
  while(cin>>n>>k){
    if(!n&&!k) break;
    vector<int> a(k);
    REP(i,k)cin>>a[i];
    sort(a.begin(),a.end());
    int ans = 0;
    int tmp1 = 0;
    int tmp2 = 0;
    bool white = (a[0]==0);
    REP(i,k){
      if(a[i]==0) continue;
      tmp1++;
      if(white&&(i==1||i==k-1)&&(1<a[i]&&a[i]<n)&&tmp2<1) tmp2=1;
      if((i<k-1&&a[i+1]-a[i]!=1)||i==k-1){
        ans = max(ans,tmp2+tmp1);
        tmp2 = (a[i+1]-a[i]==2&&white)?(tmp1+1):0;
        tmp1 = 0;
      }
    }
    cout<<ans<<endl;
  }



  return 0;
}
### Prompt

Please provide a Cpp coded solution 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 <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>

using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef complex<double> P;
static const double EPS = 1e-8;

#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)

int main(void){
  int n,k;
  while(cin>>n>>k){
    if(!n&&!k) break;
    vector<int> a(k);
    REP(i,k)cin>>a[i];
    sort(a.begin(),a.end());
    int ans = 0;
    int tmp1 = 0;
    int tmp2 = 0;
    bool white = (a[0]==0);
    REP(i,k){
      if(a[i]==0) continue;
      tmp1++;
      if(white&&(i==1||i==k-1)&&(1<a[i]&&a[i]<n)&&tmp2<1) tmp2=1;
      if((i<k-1&&a[i+1]-a[i]!=1)||i==k-1){
        ans = max(ans,tmp2+tmp1);
        tmp2 = (a[i+1]-a[i]==2&&white)?(tmp1+1):0;
        tmp1 = 0;
      }
    }
    cout<<ans<<endl;
  }



  return 0;
}
```