#include<bits/stdc++.h>
#define pii pair<int, int>
using namespace std;
const int N = 1e5+5;
int n, m, k, t, a[N];
int res[N], id[N];
int idx, hv, lst;
struct node{
    int x, y;
} p[] = {
    {0, 0}, {2, 2}, {1, 1}, {1, 2}, {1, 3}, {2, 1}, {2, 3}, {3, 1}, {3, 2}, {3, 3}
};

struct t_check{
    int x, y, z;
} mb[] {
    {1, 2, 9}, {1, 3, 8}, {1, 4, 7}, {1, 5, 6}, 
    {2, 3, 4}, {2, 5, 7}, {4, 6, 9}, {7, 8, 9}
};

bool play() {
    int s1 = 0, s3 = 0, s35 = 0, s4 = 0, s45 = 0, s5 = 0;
    // step 1
    for(int i=1; i<=9; i++) {
        if(idx > hv) break;
        if(id[i]) continue;
        s1 = 1;
        res[a[idx]] += 1;
        if(a[idx] == 0) {
            idx ++;
            hv += 1;
            if(hv > k) {
                lst += hv - k, hv = k;
            }
            return true;
        } else if(a[idx] == t){
            id[i] = a[idx];
            idx ++;
            hv += 1;
            if(hv > k) {
                lst += hv - k, hv = k;
            }
        } else {
            id[i] = a[idx];
            idx += 1;
        }
    }
    // step 2
    set<int> st;
    for(int i=1; i<=9; i++) if(id[i]) st.insert(id[i]);
    if(st.size() == 9) {
        id[1] = 0;
        return true;
    }
    // step 3
    for(auto &i : mb) {
        if(id[i.x]==0 || id[i.y]==0 || id[i.z]==0) continue;
        if(id[i.x] != id[i.y] || id[i.x] != id[i.z] || id[i.y] != id[i.z]) continue;
        s3 = 1;
        if(i.x == 1) {
            s35 = 1;
        } else {
            id[i.x] = 0;
        }
        if(i.y == 1) {
            s35 = 1;
        } else {
            id[i.y] = 0;
        }
        if(i.z == 1) {
            s35 = 1;
        } else {
            id[i.z] = 0;
        }
        hv += 5;
        if(hv > k) {
            lst += hv - k, hv = k;
        }
    }
    // step 4
    for(int i=1; i<=9; i++) {
        for(int j=i+1; j<=9; j++) {
            if(id[i] == 0 || id[j] == 0) continue;
            if(id[i] != id[j]) continue;
            s4 = 1;
            if(i == 1) {
                s45 = 1;
            } else {
                id[i] = 0;
            }
            id[j] = 0;
            hv += 1;
            if(hv > k) {
                lst += hv - k, hv = k;
            }
        }
    }
    // step 5
    if(s35 || s45) {
        id[1] = 0;
        s5 = 1;
    }
    // step 6
    if(s1 + s3 + s4 + s5 == 0) {
        return false;
    } else {
        int num = 0;
        for(int i=1; i<=9; i++) {
            // cout<<id[i]<<" ";
            if(id[i] == 0) num += 1;
        }
        // cout<<"\n";
        if(num == 9) {
            hv += 10;
            if(hv > k) {
                lst += hv - k, hv = k;
            }
        }
        return true;
    }
}

signed main(){
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    cin>>n>>m>>k>>t;
    for(int i=1; i<=k; i++) cin>>a[i];
    idx = 1, hv = n;
    while(play()) {
        // for(int i=1; i<=9; i++) cout<<id[i]<<" ";
        // cout<<"\n";
    }
    for(int i=0; i<=m; i++) cout<<res[i]<<" ";
    cout<<"\n";
    if(lst) {
        cout<<"Unhappy! "<<lst<<"\n";
    }
    return 0;
}

/*
8 9 16 2
1 0 1 1 2 3 4 5 1 6 1 7 8 9 1 1

*/