#include <bits/stdc++.h>
#define lli long long int
using namespace std;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool valid(int x,int y,int n,int m){
if(x<1 or y<1 or x>n or y>m) return false;
return true;
}
int func(int x,int y,int n,int m){
int cnt=0;
for(int i=0;i<4;i++){
if(valid(x+dx[i],y+dy[i],n,m)) cnt++;
}
return cnt;
}
void solve(){
int n,m;
cin>>n>>m;
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
cout<<min(func(x1,y1,n,m),func(x2,y2,n,m))<<endl;
}
int main(){
int t=1;
cin>>t;
while(t--){
solve();
}
return 0;
}
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |