#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 9;
const int mod = 1e9 + 7;
#define eps 1e-5
#define inf 2e18

map<int,int> mp,ans;

void solve()
{
    ll n,m,k;cin>>n>>m>>k;

    for(int i = 1;i <= k;++ i)
    {
        int x,y;cin>>x>>y;
        if(mp.find(y) != mp.end())
        {
            ans[y] -= 100;
            if(mp[y]==x) ans[y] +=100;
            else 
            {
                ans[y] += abs(mp[y] - x);
                mp[y] = x;
            }
        }
        else mp[y] = x,ans[y] += 100;
    }
    //cout<<ans<<'\n';
    for(int i= 1;i<=m;++i) 
        cout<< ans[i] << ' ';
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1; // cin>>_;
    while (_--) solve();
    return 0;
}