#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>

#define int long long

using namespace std;

const int N = 4e6 + 5;

int T, n, w, h;
vector<int> b;

struct node {
    int x, dy, uy, l;
    bool operator<(const node &jq) const {
        return x < jq.x;
    }
}s[N];

struct tree {
    int l, r;
    int maxv, lazy;
}tr[N * 4];

void pushup(int u) {
    tr[u].maxv = max(tr[u << 1].maxv, tr[u << 1 | 1].maxv);
}

void pushdown(int u) {
    if(tr[u].lazy) {
        int &cnt = tr[u].lazy;
        tr[u << 1].maxv += cnt;
        tr[u << 1].lazy += cnt;
        tr[u << 1 | 1].maxv += cnt;
        tr[u << 1 | 1].lazy += cnt;
        cnt = 0;
    }
}

void build(int u, int l, int r) {
    tr[u] = {l, r, 0, 0};
    if(l == r) return ;
    int mid = l + r >> 1;
    build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
}

void update(int u, int l, int r, int v) {
    if(l <= tr[u].l && tr[u].r <= r) {
        tr[u].lazy += v;
        tr[u].maxv += v;
        return ;
    }
    pushdown(u);
    int mid = tr[u].l + tr[u].r >> 1;
    if(l <= mid) update(u << 1, l, r, v);
    if(mid < r) update(u << 1 | 1, l, r, v);
    pushup(u);
}

signed main() {
    
    cin >> T;
    
    while(T -- ) {
        b.clear();
        cin >> n >> w >> h;
        for(int i = 1; i <= n; ++ i) {
            cin >> s[i].x >> s[i].dy >> s[i].l;
            s[i].uy = s[i].dy + h - 1;
            b.push_back(s[i].dy), b.push_back(s[i].uy);
        }
        sort(s + 1, s + n + 1);
        sort(b.begin(), b.end());
        b.erase(unique(b.begin(), b.end()), b.end());
        for(int i = 1; i <= n; ++ i) {
            s[i].dy = lower_bound(b.begin(), b.end(), s[i].dy) - b.begin() + 1;
            s[i].uy = lower_bound(b.begin(), b.end(), s[i].uy) - b.begin() + 1;
        }
        build(1, 1, b.size());
        int tt = 1, ans = 0;
        for(int i = 1; i <= n; ++ i) {
            int x = s[i].x;
            while(s[i].x == x) {
                update(1, s[i].dy, s[i].uy, s[i].l);
                i ++;
            }
            i --;
            while(tt < i && s[tt].x + w <= x) {
                update(1, s[tt].dy, s[tt].uy, -s[tt ++ ].l);
            }
            ans = max(ans, tr[1].maxv);
        }
        cout << ans << endl;
    }
    
    return 0;
}