using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
        // Test();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var nmap = NArr(n);
        var mmap = NArr(m);
        var k = NN;
        var p = NList;
        WriteLine(string.Join(" ", Rain(n, m, nmap, mmap, k, p)));
    }
    static int[] Rain(int n, int m, int[][] nmap, int[][] mmap, int k, int[] p)
    {
        var ans = Enumerable.Repeat(1, k).ToArray();
        var nlist = new List<(long pos, int flg)> { (-1_000_000_001, 0), (1_000_000_001, 0) };
        for (var i = 0; i < n; ++i)
        {
            nlist.Add((-nmap[i][0], 2));
            nlist.Add((-nmap[i][1], 1));
        }
        nlist.Sort((l, r) => {
            var d = l.pos.CompareTo(r.pos);
            if (d != 0) return d;
            return l.flg.CompareTo(r.flg);
        });
        for (var i = 0; i + 1 < nlist.Count; ++i)
        {
            if (nlist[i].flg == nlist[i + 1].flg)
            {
                return ans;
            }
        }
        var mlist = new List<(long pos, int flg)>();
        for (var i = 0; i < m; ++i)
        {
            mlist.Add((mmap[i][0], 1));
            mlist.Add((mmap[i][1], 2));
        }
        mlist.Sort((l, r) => {
            var d = l.pos.CompareTo(r.pos);
            if (d != 0) return d;
            return l.flg.CompareTo(r.flg);
        });
        for (var i = 0; i + 1 < mlist.Count; ++i)
        {
            if (mlist[i].flg == mlist[i + 1].flg)
            {
                return ans;
            }
        }
        for (var i = 0; i < k; ++i)
        {
            var flg = false;
            for (var j = 0; j < mlist.Count; j += 2)
            {
                var btime = mlist[j].pos - p[i] - p[i];
                var etime = mlist[j + 1].pos - p[i] - p[i];
                var bpos = LowerBound(0, btime, nlist);
                var epos = LowerBound(0, etime, nlist);
                if (bpos != epos)
                {
                    flg = true;
                    break;
                }
                if (nlist[bpos].flg == 2)
                {
                    flg = true;
                    break;
                }
                if (nlist[epos].flg == 1 && etime == nlist[epos].pos)
                {
                    flg = true;
                    break;
                }
            }
            if (!flg) ans[i] = 0;
        }
        return ans;
    }
    static int LowerBound(int left, long min, IList<(long pos, int flg)> list)
    {
        if (list[left].pos >= min) return left;
        var ng = left;
        var ok = list.Count;
        while (ok - ng > 1)
        {
            var center = (ng + ok) / 2;
            if (list[center].pos < min) ng = center;
            else ok = center;
        }
        return ok;
    }
}