#include<bits/stdc++.h>
using namespace std;
#define fasst ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define ll long long
#define FOR(n) for(i = 0; i < (n); i++)
#define forn(i, n, m) for(int i = (n); (n) < (m) ? i < (m) : i > (m); (n) < (m) ? ++i : --i)
#define all(a) a.begin(), a.end()
#define inp(a, n) for(i = 0; i < (n); i++) cin >> (a)[i];
#define oup(a, n) for(i = 0; i < (n); i++) cout << (a)[i] << ' ';
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vvi vector<vector<int>>
#define vll vector<ll>
#define endl '\n'
const int INF = 0x3f3f3f3f;

void solve(int testc){
    ll i, j, k, l, m, n;
    cin >> n >> m;
    vi vec(n + 1, 0), ans(n);
    FOR(n)cin >> ans[i];
    FOR(m){
        cin >> j >> k;
        vec[j - 1]++;
        vec[k]--;
    }
    FOR(n){
        vec[i + 1] += vec[i];
        vec[i] += ans[i];
    }
    FOR(n){
        if(vec[i] % 2 == 1)cout << 1 << " ";
        else cout << 0 << " ";
    }
    return;
}

int main(){
    fasst;
    int t = 1, testc = 1;
    //cin >> t;
    while(t--){
        solve(testc);
        cout << '\n';
    }
    return 0;
}