#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;

using S = long long;
using F = long long;

const S INF = 8e18;

S op(S a, S b){ return std::min(a, b); }
S e(){ return INF; }
S mapping(F f, S x){ return (f+x)%2; }
F composition(F f, F g){ return (f+g)%2; }
F id(){ return 0; }

int main(){
  ll n,q;
  cin>>n>>q;
  vector<ll> a(n);
  for(ll i=0;i<n;i++){
    cin>>a[i];
  }
  lazy_segtree<S, op, e, F, mapping, composition, id> seg(a);
  while(q--){
    ll l,r;
    cin>>l>>r;
    l--;
    seg.apply(l,r,1);
  }
  for(ll i=0;i<n;i++){
    cout<<seg.get(i)<<" ";
  }
  cout<<endl;
}