#include<bits/stdc++.h>
#include <unordered_map>
#include<cstdint>
using namespace std;
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define MAXN ((int) 2e5)
#define endl '\n'
#define yes "Yes"
#define no "No"
const int maxx = 100;
const int N = 1e5 + 5;
const int M = 5e4 + 10;
typedef long long ll;
typedef double db;
typedef pair<int, int>pii;
typedef pair<long, long>pll;
int dx[4] = { 0, 1, 0, -1 }, dy[4] = { 1, 0, -1, 0 };
const int mod = 1e9 + 7;
inline long long read()
{
	long long w = 1;
	long long q = 0;
	char ch = ' ';
	while (ch != '-' && (ch < '0' || ch>'9')) ch = getchar();
	if (ch == '-') w = -1, ch = getchar();
	while (ch >= '0' && ch <= '9')
		q = q * 10 + ch - '0', ch = getchar();
	return w * q;
}
void exgcd(int a, int p, int& x, int& y)
{
	if (!p) x = 1, y = 0;
	else exgcd(p, a % p, y, x), y -= a / p * x;
}

//bool flag[maxx];线性筛
//int prime[maxx], p;
//void primes(int n)
//{
//	flag[1] = true;
//	for (int i = 2; i <= n; i++)
//	{
//		if (!flag[i])
//			prime[p++] = i;
//		for (int j = 0; prime[j] * i <= n; j++)
//		{
//			flag[prime[j] * i] = true;
//			if (i % prime[j] == 0) break;
//		}
//	}
//}
struct node {
	int st;
	int flag = 1;
	int ed;
	int num;
	int k;
	
}arr[N];

void solve()
{
	int n, m, k;
	cin >> n >> m >> k;
	for (int i = 1; i <= k; i++)
	{
		int x, y;
		cin >> x >> y;
		if (arr[y].flag == 1)
			arr[y].st = x, arr[y].flag = 0,arr[y].num++;
		else arr[y].ed = x,arr[y].num++;
	}
	for (int i = 1; i <= m-1; i++)
	{
		if (arr[i].st == arr[i].ed)
		{
			cout << 100 << " ";
			continue;
		}
		else if (arr[i].num == 0)
		{
			cout << 0 << " ";
			continue;
		}
		else if (arr[i].num == 1)
		{
			cout << 100 << " ";
			continue;
		}
		else cout << abs(arr[i].st - arr[i].ed)<<" ";
	}
	if (arr[m].st == arr[m].ed)
	{
		cout << 100;
	}
	else if (arr[m].num == 0)
	{
		cout << 0 ;
		
	}
	else if (arr[m].num == 1)
	{
		cout << 100 ;
		
	}
	else cout << abs(arr[m].st - arr[m].ed);

	
}
int main()
{
	IOS;
	int tcase = 1;
	//cin >> tcase;
	while (tcase--)
		solve();
	return 0;

}