#include<stack>

#include<queue>

#include<map>

#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

#define fi first

#define se second

using namespace std;

typedef long long ll;

const int maxn=2e5+10;

ll b,x;

int main()

{

    int t;

    scanf("%d",&t);

    while(t--)

    {

        scanf("%lld%lld",&b,&x);

        if(b%x==1)

        {

            printf("T\n");

        }

        else

        {

            printf("F\n");

        }

    }

    return 0;

}