#include <cstdio>
#include <vector>
#include <algorithm>
#include <string>
#include <iostream>
using namespace std;
vector<int> mutiply(const vector<int>& a,const vector<int>& b)
{
    vector<int>c(a.size()+b.size()+1,0);
    for(int i=0;i<a.size();i++)
    {
        for(int j=0;j<b.size();j++)
        {
            c[i+j]+=a[i]*b[j];
        }
    }
    return c;
}
void addto(vector<int>& a,vector<int>& b, int k)
{
    a.resize(max(a.size(), b.size()+k));
    for(int i = 0; i < b.size(); i++)
    {
        a[i+k]+=b[i];

    }
}
void subfrom(vector<int>& a,vector<int>&b)
{
    a.resize(max(a.size(), b.size()+1));
    for(int i = 0; i < b.size(); i++)
    {
        a[i]-=b[i];
    }
}
vector<int> karastuba(vector<int> a,vector<int> b)
{
    int an = a.size(),bn = b.size();
    if(an < bn)karastuba(b,a);
    if(an == 0||bn == 0)return vector<int>();
    if(an <= 50) return mutiply(a,b);
    int half=an/2;
    vector<int> a1(a.begin(),a.begin() + half);
    if(bn > half)bn=half;
    vector<int> b1(b.begin(),b.begin()+ bn);
    vector<int> a0(a.begin() + half,a.end());
    vector<int> b0(b.begin() + bn , b.end());
    vector<int> z2 = karastuba(a1 , b1);
    vector<int> z0 = karastuba(a0, b0);
    addto(a0,a1,0);
    addto(b0,b1,0);
    vector<int> z1 = karastuba(a0,b0);
    subfrom(z1,z0);
    subfrom(z1,z2);
    vector<int> ret;
    addto(ret,z2,half+half);
    addto(ret,z1,half);
    addto(ret,z0,0);
    return ret;
}
int hugs(vector<int>& a,int n,int m)
{
    int hug=0;
    for(int i = n-1; i < m; i++)
    {
        if(a[i]==0)hug++;
    }
    return hug;
}
void input()
{
    string member,fans;
    int n,m;
    getline(cin,member);
    getline(cin,fans);
    n=member.size(),m=fans.size();
    vector<int> a(n),b(m);
    for(int i = 0; i < n;i++) a[i]=(member[i]=='M');
    for(int i = 0; i < m;i++) b[m-i-1]=(fans[i]=='M');
    vector<int> c = karastuba(a,b);
    printf("%d\n",hugs(c,n,m));
}
int main()
{
    int T;
    scanf("%d\n",&T);
    while(T--)
    {
        input();
    }
    return 0;
}