#include<bits/stdc++.h>
using namespace std;
int n, a[114514], x;
int erfen(int x){
int L = 1;
int R = n;
int ans = -1;
while(L <= R){
int mid = (L + R) / 2;
if(a[mid] > x){
R = mid - 1;
}
else if(a[mid] == x){
ans = mid;
break;
}
else if(a[mid] < x){
L = mid + 1;
}
}
return ans;
}
int m;
int main(){
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
}
