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

int N,K;
bool f[100000];
void solve(){
    fill_n(f,N,false);
    bool white=false;
    for(int i=0;i<K;i++){
        int a;scanf("%d",&a);
        if(a)f[--a]=true;
        else white=true;
    }
    int ma=0;
    int prev=0,cur=0,val=0;

    while(cur<N){
        if(!f[cur]){cur++;continue;}
        int next=cur;
        while(next<N&&f[next])next++;
        int x=next-cur;
        if(white&&prev+1==cur)x+=val+1;
        ma=max(ma,x);
        val=next-cur;
        prev=next;
        cur=next;
    }

    printf("%d\n",ma);
}
int main(){
    while(scanf("%d%d",&N,&K),N||K)solve();

    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<bits/stdc++.h>
using namespace std;

int N,K;
bool f[100000];
void solve(){
    fill_n(f,N,false);
    bool white=false;
    for(int i=0;i<K;i++){
        int a;scanf("%d",&a);
        if(a)f[--a]=true;
        else white=true;
    }
    int ma=0;
    int prev=0,cur=0,val=0;

    while(cur<N){
        if(!f[cur]){cur++;continue;}
        int next=cur;
        while(next<N&&f[next])next++;
        int x=next-cur;
        if(white&&prev+1==cur)x+=val+1;
        ma=max(ma,x);
        val=next-cur;
        prev=next;
        cur=next;
    }

    printf("%d\n",ma);
}
int main(){
    while(scanf("%d%d",&N,&K),N||K)solve();

    return 0;
}
```