#include<bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end()
#define lowbit(i) ((i)&(-i))
#define pii pair<int,int>
#define endl '\n'
#define mk(x,y) make_pair(x,y)
#define popcount(x) __builtin_popcount(x)
const double pi=3.14159265358979323846;
const double eps=1e-9;
const int inf=1e9;
const long long INF=4e18;
const int mod=1e9+7;
using namespace std;
const int N=1e5+10;
map<string,int>mp;
void solve()
{
    int y1,m1,d1;
    string s1;
    cin>>y1>>m1>>d1>>s1;
    int y2,m2,d2;
    // cout<<s1<<endl;
    cin>>y2>>m2>>d2;
    ll ans=mp[s1];
    // cout<<ans<<endl;
    int y=y2-y1;
    int m=m2-m1;
    int d=d2-d1;
    ans+=1ll*y*30*12;
    ans%=5;
    ans+=1ll*m*30;
    ans%=5;
    ans+=d;
    ans%=5;
    // cout<<ans<<endl;
    if(ans>=0){
    	if(ans==0){
    		cout<<"Monday\n";
    	}
    	else if(ans==1){
    		cout<<"Tuesday\n";
    	}
    	else if(ans==2){
    		cout<<"Wednesday\n";
    	}
    	else if(ans==3){
    		cout<<"Thursday\n";
    	}
    	else if(ans==4){
    		cout<<"Friday\n";
    	}
    }
    else {
    	if(ans==-4){
    		cout<<"Tuesday\n";
    	}
    	else if(ans==-3){
    		cout<<"Wednesday\n";
    	}
    	else if(ans==-2){
    		cout<<"Thursday\n";
    	}
    	else if(ans==-1){
    		cout<<"Friday\n";
    	}
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    mp["Monday"]=0;
    mp["Tuesday"]=1;
    mp["Wednesday"]=2;
    mp["Thursday"]=3;
    mp["Friday"]=4;
    int T=1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}