import java.io.BufferedReader; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.util.*; public class Main { static int N; static int xLB; static int xRB; static Enemy[] E; final static int W = 1280; final static int H = 1680; public static void main(String[] args) { FastScanner sc = new FastScanner(System.in); N = sc.nextInt(); xLB = sc.nextInt(); xRB = sc.nextInt(); E = new Enemy[N]; for (int i = 0; i < N; i++) { E[i] = new Enemy(i, sc.nextInt(), sc.nextInt(), sc.nextInt(), sc.nextInt()); } int[] array = solve(); for (int i : array) { System.out.println( i ); } } private static int[] solve() { Set hit = new HashSet<>(); for (int w = xLB; w <= xRB; w++) { final int fw = w; Arrays.sort(E, Comparator.comparingInt(e -> e.bottomOf(fw))); Enemy bottom = E[N-1]; hit.add(bottom.i); } int[] ans = new int[N]; for (int i = 0; i < N; i++) { ans[i] = hit.contains(i) ? 1 : 0; } return ans; } static class Enemy { int i; int XL, YU, XR, YD; public int bottomOf(int w) { if( XL <= w && w <= XR ) { return YD; } else { return -1; } } public Enemy(int i, int XL, int YU, int XR, int YD) { this.i = i; this.XL = XL; this.YU = YU; this.XR = XR; this.YD = YD; } } static class FastScanner { private BufferedReader reader; private StringTokenizer tokenizer; FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } long nextLong() { return Long.parseLong(next()); } int nextInt() { return Integer.parseInt(next()); } double nextDouble() { return Double.parseDouble(next()); } int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } } }