#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <vector>

int main() {
    unsigned n, m, k;
    scanf("%u%u%u", &n, &m, &k);
    std::vector<unsigned> costs(m);
    std::vector<int> p(k), c(k);
    for (unsigned i = 0; i < k; ++i) {
        scanf("%d%u", &p[i], &c[i]);
    }
    for (unsigned i = 0; i < k; ++i) {
        if (c[i]) {
            // go and look for the next card
            unsigned j = i;
            unsigned card = c[i];
            while (++j < k && card != c[j]);
            if (j == k || p[i] == p[j]) {
                costs[card - 1] += 100;
            } else {
                costs[card - 1] += abs(p[i] - p[j]);
            }
            if (j < k) c[j] = 0;
        }
    }
    for (unsigned c : costs) {
        printf("%u ", c);
    }
    return 0;
}