#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

void testCase() {
    int n, p;
    cin >> n >> p;

    int t[n];
    for (int i = 0; i < n; i++)
        cin >> t[i];

    if (!t[0] && !t[n - 1]) {
        for (int i = 0; i < n; i++)
            cout << 0 << el;

        return;
    }

    int cur = 0;

    if (t[n - 1])
        cur++;

    int sol[n];

    sol[n - 1] = cur;

    for (int i = n - 2; i >= 0; i--) {
        if (t[i] > t[i + 1])
            cur++;

        sol[i] = cur;
    }

    if (cur != p) {
        cout << "ambiguous";

        return;
    }

    for (int i = 0; i < n; i++)
        cout << sol[i] << el;
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}