#include using namespace std; template bool chmin(T &a,T b){ //a>bならa=bに更新してtrue. if(a > b){a = b; return true;} else return false; } template bool chmax(T &a,T b){ //a T safemod(T a,T m){a %= m,a += m;return a>=m?a-m:a;} //return x = a mod m. template T floor(T a,T b){ //return a/b切り下げ. if(b < 0) a *= -1,b *= -1; return a<0?(a+1)/b-1:a/b; } template T ceil(T a,T b){ //return a/b切り上げ. if(b < 0) a *= -1,b *= -1; return a>0?(a-1)/b+1:a/b; } template pair invgcd(T a,T b){ //return {gcd(a,b),x} (xa≡g(mod b)) a = safemod(a,b); if(a == 0) return {b,0}; T x = 0,y = 1,memob = b; while(a){ T q = b/a; b -= a*q; swap(x,y); y -= q*x; swap(a,b); } if(x < 0) x += memob/b; return {b,x}; } template bool isABmoreC(T a,T b,T c){ //a*b=cはfalse. if(b == 0) return c>0; if(c%b) return a>=ceil(c,b); else return a>ceil(c,b); } template bool isABmoreC2(T a,T b,T c){ //a*b=cはtrue. if(b == 0) return c>=0; return a>=ceil(c,b); } template bool isABlessC(T a,T b,T c){ //a*b=cはfalse. if(b == 0) return c<0; if(c%b) return a<=floor(c,b); else return a bool isABlessC2(T a,T b,T c){ // a*b=cはtrue. if(b == 0) return c<=0; return a<=floor(c,b); } template T Kthpower(T a,int k){ //return a^k オーバーフローは考慮しない. T ret = 1; while(k){ if(k&1) ret *= a; a *= a; k >>= 1; } return ret; } template pair Kthpower2(T a,int k){ //return {a^k,オーバーした?} オーバーフローは考慮する. T ret = 1,maxv = numeric_limits::max(); while(k){ if(k&1){ if(isABmoreC(ret,a,maxv)) return {-1,true}; ret *= a; } if(k == 1) break; if(isABmoreC(a,a,maxv)) return {-1,true}; a *= a; k >>= 1; } return {ret,false}; } template T Kthroot(T a,int k){ //return floor(a^(1/k)); assert(k > 0 && a >= 0); if(k == 1 || a <= 1) return a; T ret = pow(a,1.0/k); while(true){ auto [check,over] = Kthpower2(ret+1,k); if(over || check > a) break; ret++; } while(true){ auto [check,over] = Kthpower2(ret,k); if(!over && check <= a) break; ret--; } return ret; } template T powmod(T a,T b,T m){//a^b(mod m)を返す. assert(b >= 0); __int128_t ret = 1,p = a; while(b){ if(b&1) ret = ret*p%m; p = p*p%m; b >>= 1; } return T(ret); } template T divmod(T a,T b,T m){//a/b(mod m)を返す 素数mod必須. return (T)((__int128_t)a*powmod(b,m-2,m)%m); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int Q; cin >> Q; while(Q--){ long long a,b,sx,sy,gx,gy; cin >> a >> b >> sx >> sy >> gx >> gy; sx = floor(sx,a),gx = floor(gx,a),sy = floor(sy,b),gy = floor(gy,b); cout << abs(sx-gx)+abs(sy-gy) << "\n"; } }