#include int is_leap(int n) { if (n % 400 == 0) return 1; else if (n % 100 == 0) return -1; else if (n % 4 == 0) return 1; else return -1; } int md[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 }; int cal(int y, int m, int d) { int res = 0; res += 365 * y; res += y / 4; res -= y / 100; res += y / 400; int i; for (i = 0; i < m; i++) res += md[i]; if (is_leap(y) > 0 && m > 2) res++; res += d; return res; } int main() { int ys, ms, ds; scanf("%d %d %d", &ys, &ms, &ds); int ye, me, de; scanf("%d %d %d", &ye, &me, &de); int q; scanf("%d", &q); int y, m, d; int a, b; b = cal(ye, me, de) - cal(ys, ms, ds) + 1; for (; q > 0; q--) { scanf("%d %d %d", &y, &m, &d); a = cal(y, m, d) - cal(ye, me, de); if (a < b) printf("Less\n"); else if (a == b) printf("Same\n"); else printf("More\n"); } return 0; }