#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
#include<set>
#define int long long
using namespace std;
const int N=5e5+10;
typedef pair<int,int> PII;
set<int> s;
int a[N],f[N];
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,k,q,ss=0,ans=0,minn=1e9;
	cin>>n>>k>>q;
	while(q--)
	{
		int x,y;
		cin>>x>>y;
		if(!f[x])
		{
			ss++;
			s.insert(y);
			if(ss<=k) 
			{
				ans+=y;
				minn=min(minn,y);
			}
			else
			{
				if(y>minn) 
				{
					ans=ans+y-minn;
					minn=*++s.lower_bound(minn);				
				}
			}
			a[x]=y;f[x]=1;
		}
		else
		{
			s.insert(y);
			if(ss<=k) 
			{
				ans=ans+y-a[x];
				minn=min(minn,y);
			}
			else
			{
				if(a[x]>=minn)
				{
					if(y>=minn) ans=ans-a[x]+y;
					else ans=ans-a[x]+*--s.lower_bound(minn); 
					minn=*--s.lower_bound(minn);
				}
				else
				{
					if(y>=minn) 
					{
						ans=ans+y-minn;
						minn=*++s.lower_bound(minn);
					}
				}
			}
			s.erase(a[x]);
			a[x]=y;
		}
		cout<<ans<<'\n';
	}
	return 0;
}