M=min
for s in[*open(0)][1:]:
 H,W,h,w,x,y=map(int,s.split())
 while h>x or w>=y:h,w,x,y,H,W=w,H-h+1,y,H-x+1,W,H
 u=M(v:=W-w,-M(d:=w-y,n:=M(1-h,h-H)))
 print(2*H*W-H-W-M(h,w)-M(H-h,w-1)-M(h-1,v)+(-M(H-h,v)-1,d)[h-x==d]+(h==x)*(1+2*v+d-u+M(0,u//2-M(-2*n,v)//2)))