A. Robot Cleaner
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// #define ios ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
const int N = 1e6 + 10;
void solve()
{
ll n, m, a, b, c, d;
cin >> n >> m >> a >> b >> c >> d;
if (a <= c && b <= d) cout << min(c - a, d - b) << endl;
else if (a > c && b <= d) cout << min(2 * n - a - c, d - b) << endl;
else if (a <= c && b > d) cout << min(2 * m - b - d, c - a) << endl;
else cout << min(2 * n - a - c, 2 * m - b - d) << endl;
}
int main()
{
IOS
ll t;
cin >> t;
while (t--)
solve();
return 0;
}