# 双対BIT
class Dual_Fenwick_Tree:
    def __init__(self, n):
        self._n = n
        self.data = [0] * n

    # l 以上 r 未満の区間に x を加算する
    def prod(self, l, r, x):
        self._add(l, x)
        if r < self._n:
            self._add(r, -x)

    # 添え字 p の値を返す
    def get(self, p):
        return self._sum(p + 1) - self._sum(0)

    def _add(self, p, x):
        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p

    def _sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s


N, Q = map(int, input().split())
A = list(map(int, input().split()))

ftree = Dual_Fenwick_Tree(N)
for i, a in enumerate(A):
    ftree.prod(i, i + 1, a)

for _ in range(Q):
    l, r = map(lambda x: int(x) - 1, input().split())
    ftree.prod(l, r + 1, 1)

print(*[ftree.get(i) % 2 for i in range(N)])