#include <cstdio>
#include <algorithm>

using namespace std;

bool v[128][1024];
int nrc[128];

int main ()
{
    freopen ("defrag.in", "r", stdin);
    freopen ("defrag.out", "w", stdout);

    int var, n, m, c;
    scanf ("%d %d %d %d", &var, &n, &m, &c);

    for (int i = 1; i <= c; ++i)
    {
        int x, y;
        scanf ("%d %d", &x, &y);
        v[x][y] = v[x][m + y] = true;
    }

    if (var == 1)
    {
        int nr = 0;
        for (int i = 1; i <= n; ++i)
        {
            bool OK = false;
            for (int j = 1; j <= m && !OK; ++j)
                if (v[i][j]) OK = true;

            if (!OK) ++nr;
        }

        printf ("%d\n", nr);
        return 0;
    }

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            if (v[i][j]) ++nrc[i];

    for (int i = 1; i <= n; ++i)
    {
        int nr0 = 0, mi = nrc[i];
        for (int j = 1; j < nrc[i]; ++j)
            if (!v[i][j]) ++nr0;

        for (int j = nrc[i]; j <= m + nrc[i]; ++j)
        {
            if (!v[i][j]) ++nr0;
            if (!v[i][j - nrc[i]] && j > nrc[i]) --nr0;

            mi = min (mi, nr0);
        }

        printf ("%d ", mi);
    }

    printf ("\n");

    return 0;
}