#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<map>
using namespace std;
map<pair<int,int>,int>mp;
int n,ma,s,m,a[10010],a1,a2;
int main(){
	freopen("tallest.in","r",stdin);
	freopen("tallest.out","w",stdout);
	scanf("%d%d%d%d",&n,&s,&ma,&m);
	for(int i=1;i<=m;i++){
		scanf("%d%d",&a1,&a2);
		if(mp[make_pair(a1,a2)])continue;
		mp[make_pair(a1,a2)]=1;
		if(a1>a2){int f=a1;a1=a2;a2=f;}
		a[a1+1]--;a[a2]++;
	}
	a[1]=a[1]+ma;
	for(int i=2;i<=n;i++)a[i]=a[i-1]+a[i];
	for(int i=1;i<=n;i++)printf("%d\n",a[i]);
	return 0;
}