#include<bits/stdc++.h>
#define AC return 0;
#define int long long 
#define pii pair<int,int>
#define all(tar) tar.begian(),tar.end()
const int maxx=2e5+5;
const int mod=998244353; 
using namespace std;
int n,m,t;
int zh(int year,int mon,int day){
   int res=year*12*30+mon*30+day;
   return res;
}
map<string,int>mp;
/*
1000000000 1 1 Wednesday
2019 5 12
*/
void solve(){
   int year,mon,day;
   string str;
   cin>>year>>mon>>day>>str;
   int res1=zh(year,mon,day);
   cin>>year>>mon>>day;
   int res2=zh(year,mon,day);
   int cha=(res2-res1)%5;(cha+=5)%=5;
   int today=(mp[str]+cha-1)%5+1;
   if(today==1) cout<<"Monday\n";
   else if(today==2) cout<<"Tuesday\n";
   else if(today==3) cout<<"Wednesday\n";
   else if(today==4) cout<<"Thursday\n";
   else cout<<"Friday\n";
}
/*
8
2019 5 12 Monday
2019 5 11
2019 5 12 Monday
2019 5 10 
2019 5 12 Monday
2019 5 9
2019 5 12 Monday
2019 5 8
2019 5 12 Monday
2019 5 13
2019 5 12 Monday
2019 5 13
2019 5 12 Monday
2019 5 14 
2019 5 12 Monday
2019 5 15
2019 5 12 Monday
2019 5 16
2019 5 12 Monday
2019 5 17
*/
signed main(){
   ios::sync_with_stdio(false);
   cin.tie(0);
   cout.tie(0);
   int T;cin>>T;
   mp["Monday"]=1;mp["Tuesday"]=2;mp["Wednesday"]=3;mp["Thursday"]=4;mp["Friday"]=5;
   while(T--){
      solve();
   }
   AC
}