#include <bits/stdc++.h>
using namespace std;

const int N = 1e6 + 5;
const int SZ = 19;

int n, m, a[N];
pair<int, int> b[N];
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
map<int, vector<int>> mpl;

int sum = 0;
vector<int> cur;

void answer() {
    // found answer?
    vector<int> oth = mpl[sum];
    vector<int> ans(n + 1);
    int cnt = 0;
    for (int i : oth) {
        ans[i] = 1;
        cnt++;
    }
    for (int i : cur) {
        if (ans[i] > 0) {
            ans[i] = 0;
            cnt--;
        } else {
            ans[i] = 2;
            cnt++;
        }
    }
    if (cnt == 0) return;

    cout << "alhamdolellah\n";
    for (int i = 1; i <= n; i++) {
        cout << ans[i] << ' ';
    }
    cout << '\n';
    exit(0);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        b[i] = {a[i], i};
    }

    shuffle(b + 1, b + n + 1, rng);

    int szl = min(SZ, n);
    int szr = min(SZ, n);

    for (int msk = 0; msk < (1 << szl); msk++) {
        sum = 0;
        cur.clear();
        for (int i = 1; i <= szl; i++) {
            if (msk >> (i - 1) & 1) {
                sum += b[i].first;
                if (sum >= m) sum -= m;
                cur.push_back(b[i].second);
            }
        }
        if (mpl.count(sum)) {
            answer();
        } else {
            mpl[sum] = cur;   
        }
    }

    for (int msk = 1; msk < (1 << szr); msk++) {
        sum = 0;
        cur.clear();
        for (int i = n; i >= n - szr + 1; i--) {
            if (msk >> (n - i) & 1) {
                sum += b[i].first;
                if (sum >= m) sum -= m;
                cur.push_back(b[i].second);
            }
        }
        if (mpl.count(sum)) {
            answer();
        }
    }

    cout << "laelahaellallah\n";
}