#include <bits/stdc++.h>
using namespace std;
using ll =long long;
int main() {
// your code goes here
ll n,k;
cin>>n>>k;
vector<ll>a(n);
for(ll i=0;i<n;i++) cin>>a[i];
unordered_map<ll,ll> pos;
pos[a[0]]=0;
ll mini=LLONG_MAX;
for(ll i=1;i<n;i++){
ll req=k-a[i];
if(pos.count(req)){
ll sz=i-pos[req]+1;
mini=min(mini,sz);
}
if(!pos.count(a[i]))
pos[a[i]]=i;
}
cout<<mini<<endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnVzaW5nIGxsID1sb25nIGxvbmc7CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWxsIG4sazsKCWNpbj4+bj4+azsKCXZlY3RvcjxsbD5hKG4pOwoJZm9yKGxsIGk9MDtpPG47aSsrKSBjaW4+PmFbaV07Cgl1bm9yZGVyZWRfbWFwPGxsLGxsPiBwb3M7Cglwb3NbYVswXV09MDsKCWxsIG1pbmk9TExPTkdfTUFYOwoJZm9yKGxsIGk9MTtpPG47aSsrKXsKCQlsbCByZXE9ay1hW2ldOwoJCWlmKHBvcy5jb3VudChyZXEpKXsKCQkJbGwgc3o9aS1wb3NbcmVxXSsxOwoJCQltaW5pPW1pbihtaW5pLHN6KTsKCQl9CgkJaWYoIXBvcy5jb3VudChhW2ldKSkKCQlwb3NbYVtpXV09aTsKCX0KCWNvdXQ8PG1pbmk8PGVuZGw7CglyZXR1cm4gMDsKfQ==