http://codeforces.com/gym/100989/problem/F
#include <iostream>
#include <map>
#include <cstring>
#include <set>
#include <cstdio>
using namespace std;
int main()
{
int n,m,q;
while(cin>>n>>m>>q){
map <int,int> a;
set <int> radix;
map <int,int> num;
for(int i=1;i<=n;i++){
int x;
scanf("%d",&x);
a[i]=x;
radix.insert(x);
num[x]++;
}
for(int i=1;i<=q;i++){
int x,y;
scanf("%d%d",&x,&y);
num[a[x]]--;
if(num[a[x]]==0) radix.erase(radix.find(a[x]));
a[x]=y;
num[a[x]]++;
radix.insert(y);
cout<<m-radix.size()<<endl;
}
}
}