#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define mat(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define each(x,y) for(auto &(x):(y))
#define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); }
#define vec(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
#define mt make_tuple
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
#define mini min_element
#define maxi max_element
#define sum accumulate
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
vb beam(3000, false);
#define geta 1000
bool f(int l, int r) {
	rep(i, l, r + 1) {
		if (beam[i] == true)
			return true;
	}
	return false;
}
void g(int l, int r) {
	rep(i, l, r + 1)
		beam[i] = false;
}
int main() {
	var(int, n, L, R);
	fill(beam.begin() + L + geta, beam.begin() + R + geta, true);
	rep(i, 0 + geta, 200 + geta) cout << int(beam[i]);
	vector<tuple<int, int, int, int, int>> v;
	vi ans(n, 0);
	int x1, y1, x2, y2;
	rep(i, 0, n) {
		cin >> x1 >> y1 >> x2 >> y2;
		v.eb(mt(y2, x1 + geta, x2 + geta, y1, i));
	}
	sort(rall(v));
	each(a, v) {
		if (f(get(a, 1), get(a, 2))) {
			ans[get(a, 4)] = 1;
			g(get(a, 1), get(a, 2));
			rep(i, 0 + geta, 200 + geta) cout << int(beam[i]);
		}
	}
	each(a, ans) print(a);
	return 0;
}