#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 998244353;
const ll INF = 1e18;
const ld EPS = 1e-12;
#define endl "\n"
#define sp <<" "<<
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define dbg(x) cout << #x << " = " << x << endl
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fast_io() ios_base::sync_with_stdio(false); cin.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
template <typename Key, typename Value>
using hash_map = unordered_map<Key, Value, custom_hash>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int>(a, b)(rng);
// shuffle(all(a), rng);
struct store {
ll loc, type, start, end;
store(ll loc = -1, ll type = -1, ll start = -1, ll end = -1) : loc(loc), type(type), start(start), end(end) {;;}
bool operator<(const store &other) const {
return end < other.end;
}
};
struct query {
ll loc, year, ind;
query(ll loc = -1, ll year = -1, ll ind = -1) : loc(loc), year(year), ind(ind) {;;}
bool operator<(const query &other) const {
return year < other.year;
}
};
void solution() {
ll n, k, q; cin >> n >> k >> q;
vector<store> stores(n);
REP(i, 0, n) {
ll x, t, a, b; cin >> x >> t >> a >> b;
stores[i] = {x, t, a, b};
// cin >> stores[i].loc >> stores[i].type >> stores[i].start >> stores[i].end;
}
REP(i, 0, q) {
ll loc, year; cin >> loc >> year;
unordered_set<ll> types;
ll ans = 0;
for (auto &x : stores) {
if (x.start <= year and year <= x.end) {
types.insert(x.type);
ans = max(ans, abs(loc - x.loc));
}
}
if (types.size() == k) {
cout << ans << endl;
} else {
cout << -1 << endl;
}
}
return;
}
signed main() {
fast_io();
solution();
return 0;
}
// Notes
// is it binsearchable?
// is it greedy?
// is it DP?
// if online round: search OEIS, similar topics
// put observations together
// check for edge cases
// try "dumb" solutions, you're fast enough to rewrite
// clean up the implementation
// keep it simple
// check for overflow
// check for small N
// check for array with same or monotonic a_i
