#include <iostream>
#include<vector>
#include<unordered_map>
using namespace std;
int main() {
// your code goes here
vector<int> a={1,3,5,6,1,9,8};
unordered_map<int,int> m;
int k=4;
int dist=-1;
for(int i=0;i<a.size();i++) {
if(m.find(a[i])!=m.end()) {
dist=i-m[a[i]];
if(dist<=k) {
cout<<dist<<endl;
}
}
m[a[i]]=i;
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTx2ZWN0b3I+CiNpbmNsdWRlPHVub3JkZXJlZF9tYXA+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCgl2ZWN0b3I8aW50PiBhPXsxLDMsNSw2LDEsOSw4fTsKCXVub3JkZXJlZF9tYXA8aW50LGludD4gbTsKCWludCBrPTQ7CglpbnQgZGlzdD0tMTsKCWZvcihpbnQgaT0wO2k8YS5zaXplKCk7aSsrKSB7CgkJaWYobS5maW5kKGFbaV0pIT1tLmVuZCgpKSB7CgkJCWRpc3Q9aS1tW2FbaV1dOwoJCQlpZihkaXN0PD1rKSB7CgkJCQljb3V0PDxkaXN0PDxlbmRsOwoJCQl9CgkJfQoJCW1bYVtpXV09aTsKCX0KCXJldHVybiAwOwp9