#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int N = 19;
const int MOD = 998244353;

int T, n, q, e[4][N];
struct node {
    int x, y, w;
}a[N];
bool operator < (node l, node r) {
    return l.w < r.w;
}

int main () {
    freopen ("in.in", "r", stdin);
    freopen ("out.out", "w", stdout);

    scanf ("%d", &T);
    while (T --) {
        scanf ("%d%d", &n, &q);
        for (int i = 1; i <= n; i ++) {
            scanf ("%d%d%d", &a[i].x, &a[i].y, &a[i].w);
        }
        sort (a + 1, a + 1 + n);
        for (int i = 0; i < 4; i ++) e[i][n + 1] = -2e9;
        for (int i = n; i >= 1; i --) {
            e[0][i] = max (e[0][i + 1], a[i].x + a[i].y);
            e[1][i] = max (e[1][i + 1], -a[i].x + a[i].y);
            e[2][i] = max (e[2][i + 1], -a[i].x - a[i].y);
            e[3][i] = max (e[3][i + 1], a[i].x - a[i].y);
        }
        for (int i = 1; i <= q; i ++) {
            int x, y; scanf ("%d%d", &x, &y);
            int l = 1, r = n, ans = 0;
            while (l <= r) {
                int mid = (l + r) >> 1;
                int chk = max ({e[0][mid]-x-y, e[1][mid]+x-y, e[2][mid]+x+y, e[3][mid]-x+y});
                if (chk >= a[mid].w) {
                    ans = max (ans, a[mid].w);
                    l = mid + 1;
                }else {
                    ans = max (ans, chk);
                    r = mid - 1;
                }
            }
            printf("%d\n", ans);
        }
    }

    return 0;
}