#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <stack>

#ifdef LOCAL
template <class T, size_t size = std::tuple_size<T>::value> std::string to_debug(T, std::string s = "") requires(not std::ranges::range<T>);
std::string to_debug(auto x) requires requires(std::ostream& os) { os << x; } { return static_cast<std::ostringstream>(std::ostringstream() << x).str(); }
std::string to_debug(std::ranges::range auto x, std::string s = "") requires(not std::is_same_v<decltype(x), std::string>) {
  for (auto xi : x) { s += ", " + to_debug(xi); }
  return "[" + s.substr(s.empty() ? 0 : 2) + "]";
}
template <class T, size_t size> std::string to_debug(T x, std::string s) requires(not std::ranges::range<T>) {
  [&]<size_t... I>(std::index_sequence<I...>) { ((s += ", " + to_debug(get<I>(x))), ...); }(std::make_index_sequence<size>());
  return "(" + s.substr(s.empty() ? 0 : 2) + ")";
}
#define debug(...) std::cerr << __LINE__ << ": (" #__VA_ARGS__ ") = " << to_debug(std::tuple(__VA_ARGS__)) << "\n"
#else
#define debug(x...)
#endif

using i64 = long long;
#define int long long

constexpr int P{5};
std::array<std::string, P> days{"Monday", "Tuesday", "Wednesday", "Thursday", "Friday"};

void solve()
{
#define tests

	auto multiply = [&](auto a, auto b) {a *= b; a %= P; return a;};
	auto add = [&](auto a, auto b, auto c) {a += b; a %= P; a += c; a %= P; return a;};

	int y1, m1, d1; std::string st; std::cin >> y1 >> m1 >> d1 >> st;
	int y2, m2, d2; std::cin >> y2 >> m2 >> d2;
	int td1{add(multiply(y1, 360), multiply(m1, 30), d1)};
	int td2{add(multiply(y2, 360), multiply(m2, 30), d2)};
	
	int now_day{std::distance(std::begin(days), std::find(std::begin(days), std::end(days), st))};

	if (td1 < td2) {
		int res{now_day + (td2 - td1)}; res %= P;
		std::cout << days.at(res) << "\n";
	} else {
		int res{(now_day - (td1 - td2) + P)}; res %= P;
		std::cout << days.at(res) << "\n";
	}
}
 
signed main()
{
    std::cin.tie(nullptr)->sync_with_stdio(false);
    int _{1};
#ifdef tests
    std::cin >> _;
#endif
    while(_--) solve();
    return 0;
}