#include <iostream>

#include <cstdio>

#include <cstring>

#include <cstdlib>

#include <cmath>

#include <algorithm>

#define eps 1e-8

using namespace std;

#define N 100017

struct Point{

    double x,y;

    Point(double x=, double y=):x(x),y(y) {}

    void input() { scanf("%lf%lf",&x,&y); }

};

typedef Point Vector;

struct Circle{

    Point c;

    double r;

    Circle(){}

    Circle(Point c,double r):c(c),r(r) {}

    Point point(double a) { return Point(c.x + cos(a)*r, c.y + sin(a)*r); }

    void input() { scanf("%lf%lf%lf",&c.x,&c.y,&r); }

};

struct Line{

    Point p;

    Vector v;

    double ang;

    Line(){}

    Line(Point p, Vector v):p(p),v(v) { ang = atan2(v.y,v.x); }

    Point point(double t) { return Point(p.x + t*v.x, p.y + t*v.y); }

    bool operator < (const Line &L)const { return ang < L.ang; }

};

int dcmp(double x) {

    if(x < -eps) return -;

    if(x > eps) return ;

    return ;

}

template <class T> T sqr(T x) { return x * x;}

Vector operator + (Vector A, Vector B) { return Vector(A.x + B.x, A.y + B.y); }

Vector operator - (Vector A, Vector B) { return Vector(A.x - B.x, A.y - B.y); }

Vector operator * (Vector A, double p) { return Vector(A.x*p, A.y*p); }

Vector operator / (Vector A, double p) { return Vector(A.x/p, A.y/p); }

bool operator < (const Point& a, const Point& b) { return a.x < b.x || (a.x == b.x && a.y < b.y); }

bool operator >= (const Point& a, const Point& b) { return a.x >= b.x && a.y >= b.y; }

bool operator <= (const Point& a, const Point& b) { return a.x <= b.x && a.y <= b.y; }

bool operator == (const Point& a, const Point& b) { return dcmp(a.x-b.x) ==  && dcmp(a.y-b.y) == ; }

double Dot(Vector A, Vector B) { return A.x*B.x + A.y*B.y; }

double Length(Vector A) { return sqrt(Dot(A, A)); }

double Angle(Vector A, Vector B) { return acos(Dot(A, B) / Length(A) / Length(B)); }

double Cross(Vector A, Vector B) { return A.x*B.y - A.y*B.x; }

Vector VectorUnit(Vector x){ return x / Length(x);}

Vector Normal(Vector x) { return Point(-x.y, x.x) / Length(x);}

double angle(Vector v) { return atan2(v.y, v.x); }

bool SegmentIntersection(Point A,Point B,Point C,Point D) {

    return max(A.x,B.x) >= min(C.x,D.x) &&

           max(C.x,D.x) >= min(A.x,B.x) &&

           max(A.y,B.y) >= min(C.y,D.y) &&

           max(C.y,D.y) >= min(A.y,B.y) &&

           dcmp(Cross(C-A,B-A)*Cross(D-A,B-A)) <=  &&

           dcmp(Cross(A-C,D-C)*Cross(B-C,D-C)) <= ;

}

//data segment

struct node{

    Point P[];

}line[];

//data ends

int main()

{

    int T;

    scanf("%d",&T);

    while(T--)

    {

        double x1,y1,x2,y2;

        double xleft,ytop,xright,ybottom;

        Point A,B;

        A.input(), B.input();

        scanf("%lf%lf%lf%lf",&xleft,&ytop,&xright,&ybottom);

        Point P1,P2,P3,P4;

        double XL = min(xleft,xright);

        double XR = max(xleft,xright);

        double YB = min(ybottom,ytop);

        double YT = max(ybottom,ytop);

        xleft = XL, xright = XR, ybottom = YB, ytop = YT;

        P1 = Point(xleft,ytop);

        P2 = Point(xleft,ybottom);

        P3 = Point(xright,ytop);

        P4 = Point(xright,ybottom);

        int flag = ;

        if(SegmentIntersection(A,B,P1,P3) || SegmentIntersection(A,B,P1,P2) || SegmentIntersection(A,B,P2,P4) || SegmentIntersection(A,B,P3,P4))

            flag = ;

        if(dcmp(A.x-xleft) >=  && dcmp(A.x-xright) <=  && dcmp(A.y-ytop) <=  && dcmp(A.y-ybottom) >=  && dcmp(B.x-xleft) >=  && dcmp(B.x-xright) <=  && dcmp(B.y-ytop) <=  && dcmp(B.y-ybottom) >= )

            flag = ;

        if(flag) puts("T");

        else     puts("F");

    }

    return ;

}