using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Trace;
using SB = System.Text.StringBuilder;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var n = ri;
            var m = ri;
            var q = ri;
            var l = new int[m + q];
            var r = new int[m + q];
            var v = new long[m + q];
            for (int i = 0; i < m + q; i++)
            {
                l[i] = ri - 1;
                r[i] = ri;
                v[i] = rl;
            }

            var xs = v.OrderBy(x => x).Distinct().ToList();
            for (int i = 0; i < m; i++)
                v[i] = xs.BinarySearch(v[i]);


            var L = Enumerate(q, x => -1);
            var R = Enumerate(q, x => xs.Count - 1);
            var seg = new Node(0, n);
            for (int i = 0; i < m; i++)
                seg.Add(l[i], r[i], 0);
            const long MN = 1000000000;
            for (int _ = 0; _ < 20; _++)
            {
                var query = new long[m + q];
                for (int i = 0; i < m; i++)
                    query[i] = v[i] * MN + i;
                for (int i = 0; i < q; i++)
                    query[i + m] = ((L[i] + R[i]) / 2) * MN + i + m;
                Array.Sort(query);
                for (int i = 0; i < m + q; i++)
                {
                    var x = query[i] / MN;
                    var id = query[i] % MN;
                    if (id < m) seg.Add(l[id], r[id], 1);
                    else
                    {
                        var cnt = seg.Sum(l[id], r[id]);
                        if (cnt < v[id]) L[id - m] = (int)x;
                        else R[id - m] = (int)x;
                    }
                }
                for (int i = 0; i < m; i++)
                    seg.Add(l[i], r[i], -1);
            }
            for (int i = 0; i < q; i++)
                Console.WriteLine(xs[R[i]]);

        }
        const long INF = 1L << 60;
        //int[] dx = { -1, 0, 1, 0 };
        //int[] dy = { 0, 1, 0, -1 };
        //*
        int ri { get { return sc.Integer(); } }
        long rl { get { return sc.Long(); } }
        double rd { get { return sc.Double(); } }
        string rs { get { return sc.Scan(); } }
        //*/

        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ")
    {
        return string.Join(st, ie.Select(x => x.ToString()).ToArray());
        //return string.Join(st, ie);
    }
    static public void Main()
    {
        Console.SetOut(new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Program.Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer: StreamWriter
    {
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n' && b != 0; b = (char)read())
                if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
        public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
        public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
}
#endregion
public class Node
{
    public int l, r;
    public long add;
    public long sum;
    Node lst, rst;
    public Node(int L, int R)
    {
        l = L; r = R;
    }
    public void Add(int L, int R, long x)
    {
        if (r <= L || R <= l) return;
        else if (L <= l && r <= R)
        {
            add += x;
        }
        else
        {
            var m = (l + r) / 2;
            if (lst == null) lst = new Node(l, m);
            if (rst == null) rst = new Node(m, r);
            lst.Add(L, R, x);
            rst.Add(L, R, x);
            sum = (m - l) * lst.add + (r - m) * rst.add + lst.sum + rst.sum;
        }
    }
    public long Sum(int L, int R)
    {
        if (r <= L || R <= l) return 0;
        else if (L <= l && r <= R)
        {
            return (r - l) * add + sum;
        }
        else
        {
            var m = (l + r) / 2;
            if (lst == null) lst = new Node(l, m);
            if (rst == null) rst = new Node(m, r);
            return (Math.Max(0, Math.Min(R, r) - Math.Max(l, L))) * add + lst.Sum(L, R) + rst.Sum(L, R);
        }
    }
}


Measured memory_bytes: 523180