#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define PA pair #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) /* #include namespace mp=boost::multiprecision; using Bint=mp::cpp_int; */ templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vector&v){REP(i,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b>N>>L>>R; vector>G(1281,vector(1681)); REP(i,N){ ll l,u,r,d;cin>>l>>u>>r>>d; FOR(x,max(l,0LL),min(r,1280LL)+1)FOR(y,max(u,0LL),min(d,1680LL)+1)G[x][y]=i+1; } vectorans(N); vectorBEAM(1281); FOR(x,L,R+1)BEAM[x]=1; RREP(y,1681){ REP(x,1281)if(BEAM[x]){ if(G[x][y]){ ans[G[x][y]-1]=1;BEAM[x]=0; } } } REP(i,N)cout<