You are given array a a of length n n . You can choose one segment [l,r] [l,r] (1≤l≤r≤n 1≤l≤r≤n ) and integer value k k (positive, negative or even zero) and change a l ,a l+1 ,…,a r  al,al+1,…,ar by k k each (i.e. a i :=a i +k ai:=ai+k for each l≤i≤r l≤i≤r ).

What is the maximum possible number of elements with value c c that can be obtained after one such operation?

Input

The first line contains two integers n n and c c (1≤n≤5⋅10 5  1≤n≤5⋅105 , 1≤c≤5⋅10 5  1≤c≤5⋅105 ) — the length of array and the value c c to obtain.

The second line contains n n integers a 1 ,a 2 ,…,a n  a1,a2,…,an (1≤a i ≤5⋅10 5  1≤ai≤5⋅105 ) — array a a .

Output

Print one integer — the maximum possible number of elements with value c c which can be obtained after performing operation described above.

Examples

6 9

9 9 9 9 9 9

6

3 2

6 2 6

2

#include<bits/stdc++.h>

#define ll long long

#define rep(i,a,b) for(int i=a;i<=b;i++)

using namespace std;

const int maxn=;

int a[maxn],b[maxn],Laxt[maxn],ans,N,C,res;

vector<int>G[maxn];

int main()

{

    scanf("%d%d",&N,&C); int Z=;

    rep(i,,N)  scanf("%d",&a[i]),a[i]=a[i]-C+Z;

    rep(i,,N) {

        b[i]=b[i-]; if(a[i]==Z) b[i]++;

        int pre=Laxt[a[i]]; if(pre==) pre=i;

        G[a[i]].push_back(-b[i]+b[pre]);

        Laxt[a[i]]=i;

    }

    ans=b[N];

    rep(i,,maxn-) {

        if(i==Z) continue;

        int tmp=;

        for(int j=;j<G[i].size();j++){

            tmp+=G[i][j];

            res=max(tmp,res);

            if(tmp<=) tmp=;

        }

    }

    printf("%d\n",ans+res);

    return ;

}

//8 4 4 0 0 4 2 1 0 4

//12 1 1 0 1 0 1 1 1 0 0 1 1 0