#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
// double rngesus_d(double l, double r){
// double cur = rngesus(0, MASK(60) - 1);
// cur /= MASK(60) - 1;
// return l + cur * (r - l);
// }
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int N = 3e5 + 69, INF = 1e9 + 69;
vector<int> X, T;
vector<pair<int,int>> coin_slot[N];
vector<int> enter_home[N], exit_home[N];
int ans[N];
multiset<int> S[N];
map<array<int, 3>, vector<int>> mp;
vector<array<int, 5>> rect;
void call_add(int t, int l, int r, int lean){
array<int, 3> cur = {{l, r, lean}};
mp[cur].push_back(t);
}
void call_del(int t, int l, int r, int lean){
array<int, 3> cur = {{l, r, lean}};
int _t = mp[cur].back(); mp[cur].pop_back();
array<int, 5> cur_rect = {{l, r, _t, t-1, lean}};
rect.push_back(cur_rect);
}
void add(int type, int pos, int t){
if (S[type].find(pos) != S[type].end()) {
S[type].insert(pos);
return;
}
int l = -1, r = -1;
auto it = S[type].lower_bound(pos);
if (it != S[type].end()){
r = *it;
}
if (it != S[type].begin()){
it--;
l = *it;
}
if (l != -1 || r != -1) {
if (l == -1){
call_del(t, 1, r, 1);
}
else if (r == -1){
call_del(t, l, INF, 0);
}
else{
int mid = (l + r) >> 1;
call_del(t, l, mid, 0);
call_del(t, mid+1, r, 1);
}
}
if (l == -1){
call_add(t, 1, pos, 1);
}
else{
int mid = (l + pos) >> 1;
call_add(t, l, mid, 0);
call_add(t, mid+1, pos, 1);
}
if (r == -1){
call_add(t, pos, INF, 0);
}
else{
int mid = (pos + r) >> 1;
call_add(t, pos, mid, 0);
call_add(t, mid+1, r, 1);
}
S[type].insert(pos);
}
void del(int type, int pos, int t){
S[type].erase(S[type].find(pos));
if (S[type].find(pos) != S[type].end()) {
return;
}
int l = -1, r = -1;
auto it = S[type].lower_bound(pos);
if (it != S[type].end()){
r = *it;
}
if (it != S[type].begin()){
it--;
l = *it;
}
if (l != -1 || r != -1) {
if (l == -1){
call_add(t, 1, r, 1);
}
else if (r == -1){
call_add(t, l, INF, 0);
}
else{
int mid = (l + r) >> 1;
call_add(t, l, mid, 0);
call_add(t, mid+1, r, 1);
}
}
if (l == -1){
call_del(t, 1, pos, 1);
}
else{
int mid = (l + pos) >> 1;
call_del(t, l, mid, 0);
call_del(t, mid+1, pos, 1);
}
if (r == -1){
call_del(t, pos, INF, 0);
}
else{
int mid = (pos + r) >> 1;
call_del(t, pos, mid, 0);
call_del(t, mid+1, r, 1);
}
}
vector<pair<int, int>> st[N * 4];
void update(int u, int v, pair<int, int> val, int l, int r, int id){
if (u <= l && r <= v){
st[id].push_back(val);
return;
}
int mid = (l + r) >> 1;
if (u <= mid) update(u, v, val, l, mid, id * 2);
if (v > mid) update(u, v, val, mid + 1, r, id * 2 + 1);
}
void answer_question1(const vector<pair<int,int>> &arr, const vector<pair<int, int>> &ranges){
int j = 0;
for(pair<int, int> i: ranges){
while(j < (int) arr.size() && arr[j].first < i.first)
j++;
while(j < (int) arr.size() && arr[j].first <= i.second){
maximize(ans[arr[j].second], abs(i.first - arr[j].first));
j++;
}
}
}
vector<pair<int,int>> dfs(int l, int r, int id){
if (l == r){
vector<pair<int,int>> arr;
for(auto i: coin_slot[l]) if (ans[i.second] != -1) arr.push_back(i);
answer_question1(arr, st[id]);
return arr;
}
int mid = (l + r) >> 1;
vector<pair<int, int>> left = dfs(l, mid, id * 2), right = dfs(mid+1, r, id * 2 + 1);
vector<pair<int,int>> arr(left.size() + right.size());
merge(ALL(left), ALL(right), arr.begin());
answer_question1(arr, st[id]);
return arr;
}
void solve(){
int n, k, q; cin >> n >> k >> q;
vector<array<int, 4>> homes(n);
for(int i= 0; i < n; ++i) {
for(int j = 0; j < 4; ++j) cin >> homes[i][j];
}
vector<pair<int,int>> queries(q);
for(int i = 0; i < q; ++i) cin >> queries[i].first >> queries[i].second;
X.push_back(0); T.push_back(0);
for(auto i: queries){
T.push_back(i.second);
}
remove_dup(T);
for(int i = 0; i < q; ++i){
int t = lower_bound(ALL(T), queries[i].second) - T.begin();
coin_slot[t].push_back(make_pair(queries[i].first, i));
}
for(int i = 0; i < n; ++i){
int l = lower_bound(ALL(T), homes[i][2]) - T.begin();
int r = upper_bound(ALL(T), homes[i][3]) - T.begin() - 1;
if (l > r) continue;
enter_home[l].push_back(i);
exit_home[r].push_back(i);
}
int cnt = 0;
for(int it = 1; it < (int)T.size(); ++it){
for(int i: enter_home[it]){
int pos = homes[i][0], type = homes[i][1];
if (S[type].empty()) cnt++;
add(type, pos, it);
}
for(pair<int,int> i: coin_slot[it]){
if (cnt < k) ans[i.second] = -1;
}
for(int i: exit_home[it]){
int pos = homes[i][0], type = homes[i][1];
del(type, pos, it + 1);
if (S[type].empty()) cnt--;
}
}
for(auto pp: mp){
array<int, 3> wow = pp.first;
for(int j: pp.second){
array<int, 5> cur_rect = {{wow[0], wow[1], j, T.size() - 1, wow[2]}};
rect.push_back(cur_rect);
}
}
for(int i = 1; i < (int)T.size(); ++i) sort(ALL(coin_slot[i]));
sort(ALL(rect));
for(int i = 1; i <= (int)T.size() * 4; ++i) st[i].clear();
for(auto i: rect) if (i[4] == 0 && i[2] <= i[3]){
update(i[2], i[3], make_pair(i[0], i[1]), 1, T.size() - 1, 1);
}
vector<pair<int, int>> lmao = dfs(1, T.size() - 1, 1);
for(int i = 1; i < (int) T.size(); ++i){
for(pair<int, int> &j: coin_slot[i]) j.first = -j.first;
sort(ALL(coin_slot[i]));
}
for(auto &i: rect){
swap(i[0], i[1]);
i[0] = -i[0]; i[1] = -i[1];
}
sort(ALL(rect));
for(int i = 1; i <= (int)T.size() * 4; ++i) st[i].clear();
for(auto i: rect) if (i[4] == 1 && i[2] <= i[3]){
update(i[2], i[3], make_pair(i[0], i[1]), 1, T.size() - 1, 1);
}
lmao = dfs(1, T.size() - 1, 1);
for(int i = 0; i < q; ++i) cout << ans[i] << "\n";
}
int main(void){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
clock_t start = clock();
solve();
cerr << "Time elapsed: " << clock() - start << "ms!\n";
return 0;
}
