#include <set>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define N ()
#define inf (0x3f3f3f3f)
#define INF (0x3f3f3f3f3f3f3f3fll)
#define LL long long
LL T, y, m, d;
string day;
string week[5] = {"Monday", "Tuesday", "Wednesday", "Thursday", "Friday"};

inline int read() {
    int x = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch > '9')
        ch == '-' ? f = -1, ch = getchar() : ch = getchar();
    while (ch >= '0' && ch <= '9')
        x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
    return x * f;
}

int main() {
    ios::sync_with_stdio(false);
    cin >> T;
    while (T--) {
        cin >> y >> m >> d >> day;
        LL res1 = y * 12 * 30 + m * 30 + d;
        cin >> y >> m >> d;
        LL res2 = y * 12 * 30 + m * 30 + d;
        LL now = 0;
        for (int i = 0; i < 5; ++i) 
            if (week[i] == day) now = i;
        // cout << res1 << " " << res2 << " "  << abs(res2 - res1) % 5 << "\n";
        cout << week[((now + res2 - res1) % 5 + 5) % 5] << "\n";
    }
    return 0;
}