#include <iostream> 
#include<cstring>
#include <vector> 
#include <queue> 
#include <limits> 
#include <cmath> 
using namespace std; 
int t,n,b[100000];
int main(){
    cin>>t>>n;
    for(int i=1;i<=t;i++){
        memset(b,0,sizeof(b));
        char s[n];
        for(int j=0;j<n;j++){
            cin>>s[j];
            b[s[j]-'0']++;
        }
        for(int j=0;j<n;j++){
            if(b[s[j]-'0']>1&&b[s[j+1]-'0']>1){cout<<"F"<<endl;break;}
            if(b[s[j]-'0']==1&&b[s[j+1]-'0']==1){cout<<"F"<<endl;break;}
            if(j==n-1) cout<<"T"<<endl;
        }
    }
    return 0;
}