#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;

void add(int &y, int &m, int &d)
{
	const int days[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
	auto is_leap = [](int y) -> bool
	{
		return y % 4 == 0 && (y % 100 != 0 || y % 400 == 0);
	};

	if(is_leap(y) && m == 2 && d == 28)
	{
		d++;
		return ;
	}

	d++;
	if(days[m] < d)
		d = 1, m++;
	if(m == 13)
		m = 1, y++;
}

// if 1 < 2
bool les(int y1, int m1, int d1, int y2, int m2, int d2)
{
	if(y1 > y2)	return false;
	if(y1 < y2)	return true;
	if(m1 > m2)	return false;
	if(m1 < m2)	return true;
	return d1 < d2;
}

bool equ(int y1, int m1, int d1, int y2, int m2, int d2)
{
	return y1 == y2 && m1 == m2 && d1 == d2;
}

void solve()
{
	int ys, ms, ds;
	int ye, me, de;
	cin >> ys >> ms >> ds >> ye >> me >> de;
	int active = 0;
	while(ys != ye || ms != me || ds != de)
		active++, add(ys, ms, ds);

	int yg = ye, mg = me, dg = de;
	add(yg, mg, dg);
	for(int i=0; i<active; i++)
		add(yg, mg, dg);

	int q;
	cin >> q;
	while(q--)
	{
		int y, m, d;
		cin >> y >> m >> d;
		if(les(y, m, d, yg, mg, dg))	cout << "Less\n";
		else if(equ(y, m, d, yg, mg, dg))	cout << "Same\n";
		else	cout << "More\n";
	}
}

signed main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int t = 1;
	// cin >> t;
	while(t--)
		solve();
}

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("trapv")
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// shuffle(a.begin(), a.end(), rng);
// uniform_int_distribution<long long>(l, r)(rng); // [l, r]
// freopen(".in", "r", stdin);
// freopen(".out", "w", stdout);