#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N=1e5+29;
vector<int>B;
vector<int> countScans(vector<int> A,vector<int> X,vector<int> V){
ll Q=X.size();
B=A;
vector<int> answer(Q);
for (int j=0;j<Q;j++) {
A[X[j]]=V[j];
B=A;
if(is_sorted(A.begin(),A.end())){
answer.push_back(0);
continue;
}
sort(B.begin(),B.end());
ll cnt=0;
for(ll i=B.size()-1;i>=0;i--){
if(B[i]==A[i]){
cnt++;
}else break;
}
answer.push_back(A.size()-cnt-1);
}
return answer;
}
