1642A - Hard Way - CodeForces Solution

//K.I.O.
#include <bits/stdc++.h>
//#include "/Users/k.i.o./Downloads/stdc++.h"
using namespace std;
long long n, a, b, c, d, j, t, m, k, u, q, x, y;
using ll = long long;
struct lkio{
    ll x, y;
};
lkio p1, p2, p3;
void F(){
    cin >> p1.x >> p1.y;
    cin >> p2.x >> p2.y;
    cin >> p3.x >> p3.y;
    a = max(p1.y, max(p2.y, p3.y));
    if(a == p1.y && a == p2.y) {
        cout << abs(p1.x - p2.x) << "\n";
        return;
    }
    if(a == p3.y && a == p2.y){
        cout << abs(p3.x - p2.x) << "\n";
        return;
    }
    if(a == p1.y && a == p3.y){
        cout << abs(p1.x - p3.x) << "\n";
        return;
    }
    cout << 0 << "\n";
}
int main(){
    cin >> t;
    while(t--) F();
}