import java.io.*;
import java.util.StringTokenizer;
class Main {
    static int n, m, arr[], seg[];
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        n = Integer.parseInt(st.nextToken());
        m = Integer.parseInt(st.nextToken());
        arr = new int[n];
        seg = new int[4 * n + 1];
        st = new StringTokenizer(br.readLine());
        for (int i = 0; i < n; i++)
            arr[i] = Integer.parseInt(st.nextToken());
        makeSeg(0, n-1, 1);
        int bought = 987654321;
        boolean have = false;
        for (int i = 0; i < n; i++) {
            if(bought < arr[i]){
                bought = 987654321;
                System.out.println(1);
            }else{
                int higher = existHigher((i == n - 1 ? n - 1 : i + 1), n - 1, 0, n - 1,1); // segment로 푼다.
                if(higher > arr[i]){
                    System.out.println(0);
                    bought = arr[i];
                }
                else System.out.println(-1);
            }
        }
    }
    private static int makeSeg(int start, int end, int node) {
        if (start == end) return seg[node] = arr[start];
        int mid = (start + end) / 2;
        return seg[node] = Math.max(makeSeg(start, mid, node * 2), makeSeg(mid + 1, end, node * 2 + 1));
    }
    static int existHigher(int left, int right, int start, int end, int node){
        if(start > right || end < left) return -1;
        if(left <= start && end <= right) return seg[node];
        int mid = (start + end) / 2;
        return Math.max(existHigher(left, right, start, mid, node * 2), existHigher(left, right, mid + 1, end, node * 2 + 1));
    }
}