include [HTML_REMOVED]

using namespace std;

include [HTML_REMOVED]

unordered_map[HTML_REMOVED]tag;
unordered_map[HTML_REMOVED]judge;
int main()
{
int n,p,h,m;
int arr[5010]={0},diff[5010]={0};
scanf(“%d %d %d %d”,&n,&p,&h,&m);

for(int i=1;i<=n;i++)
{
    arr[i] = h;
}

for(int i=1;i<=m;i++)
{
    int left,right;
    scanf("%d %d",&left,&right);
    if(left > right)
    {
        int temp= left;
        left = right;
        right = temp;
    }
    if(right == left+1 ||tag[left+1]== right-1 ||judge[right-1]==left+1)
    {
        continue;
    }
    //没见过
    if(tag.find(left+1) == tag.end())
    {
        tag[left+1]=right-1;
    }
    else//见过了，就反过来存judge
    {
        judge[right-1]=left+1;
    }

    //差分数组
    diff[left+1]--;
    diff[right]++;
}

for(int i=1;i<=5005;i++)
{
    diff[i] += diff[i-1];
}

for(int i=1;i<=n;i++)
{
    printf("%d\n",diff[i]+arr[i]);
}
return 0;

}