#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int q; cin >> q;
	while (q--) {
		long long a, b, sx, sy, tx, ty;
		cin >> a >> b >> sx >> sy >> tx >> ty;
		int mnx = min(sx, tx);
		int mny = min(sy, ty);
		if (mnx < 0) {
			auto add = ((abs(mnx) + a - 1) / a + 1) * a;
			sx += add;
			tx += add;
		}
		if (mny < 0) {
			auto add = ((abs(mny) + b - 1) / b + 1) * b;
			sy += add;
			ty += add;
		}
		sx /= a;
		tx /= a;
		sy /= b;
		ty /= b;
		auto ans = abs(sx - tx) + abs(sy - ty);
		cout << ans << endl;
	}
	return 0;
}