#include <iostream>
#include <vector>
#include <set>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <complex>
#include <stack>
#include <set>
#include "bubblesort2.h"
#include <fstream>
#define FOR(i,n) for(int i=0;i<n;i++)
#define FORE(i,a,b) for(int i=a;i<=b;i++)
#define ll long long int
#define vi vector<int>
#define v vector
#define ii pair<int,int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pll pair<ll,ll>
#define cd complex<double>
#define iil pair<ii,ll>
#define v vector
const int MAXN = 5e5+10;
const int INF = 1e9+5;
using namespace std;
//int n,k;
int arr[MAXN];
int rgt[MAXN];
vi countScans(vi ar,vi xx,vi vals){
int n = ar.size();
FOR(i,n)arr[i] = ar[i];
int q = vals.size();
vi ans(q);
FOR(i,q){
arr[xx[i]] = vals[i];
int mx = 0;
FOR(i,n){
int ctr = 0;
FOR(j,i){
if(arr[j] > arr[i])ctr++;
}
mx = max(mx, ctr);
}
ans[i] = mx;
}
return ans;
}
/*
int main(){
int n,q;
cin >> n >> q;
v<int> ar(n);
FOR(i,n){
cin >> ar[i];
}
v<int> x(q),vals(q);
x.reserve(q);
vals.reserve(q);
FOR(i,q){
cin >> x[i] >> vals[i];
}
vi ret = countScans(ar,x,vals);
FOR(i,q)cout << ret[i] << " ";cout << endl;
return 0;
}
*/
