#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn=100000+10;

#define gc() (p1 == p2 ? (p2 = buf + fread(p1 = buf, 1, 1 << 20, stdin), p1 == p2 ? EOF : *p1++) : *p1++)

#define read() ({ register int x = 0, f = 1; register char c = gc(); while(c < '0' || c > '9') { if (c == '-') f = -1; c = gc();} while(c >= '0' && c <= '9') x = x * 10 + (c & 15), c = gc(); f * x; })

char buf[1 << 20], *p1, *p2;

int n;

ll k;

int a[maxn],b[maxn],buc[maxn];

bool cmp(int x,int y){

	return x<y;

}

bool check(int x){

	memset(buc,0,sizeof(buc));

	int head=0;

	ll res=0;

	for(int i=1;i<=n;++i){

		buc[a[i-1]]--;

		while(head<=n&&buc[a[head+1]]+1<x){

			head++;

			buc[a[head]]++;

		}

		if(head>n) head--;

		res+=head-i+1;

	}

	return res>=k;

}

void Solve(){

	scanf("%d%lld",&n,&k);

	k=1ll*n*(n+1)/2-k+1;

	for(int i=1;i<=n;++i){

		scanf("%d",&a[i]);

		b[i]=a[i];

	}

	sort(b+1,b+n+1,cmp);

	b[0]=unique(b+1,b+n+1)-b-1;

	for(int i=1;i<=n;++i){

		a[i]=lower_bound(b+1,b+b[0]+1,a[i])-b;

		buc[a[i]]++;

	}

	int L=1,R=0;

	for(int i=1;i<=b[0];++i) R=max(R,buc[i]);

	while(L<=R){

		int mid=(L+R)>>1;

		if(check(mid)) R=mid-1;

		else L=mid+1;

	}

	printf("%d\n",R);

}

int main(){

	freopen("C.in","r",stdin);

        freopen("C.out","w",stdout);

	Solve();

	return 0;

}