#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf=1e18;
const int maxn=200005;
ll ys,ms,ds,ye,me,de,q,y,m,d;
ll md[15]={0,31,28,31,30,31,30,31,31,30,31,30,31};
bool leap(ll y){
    return (y%4==0 and y%100!=0) or (y%400==0);
}
ll get_days(ll y,ll m,ll d){
    ll i,res=0;
    for(i=1;i<y;i++){
        res+=365+leap(i);
    }
    for(i=1;i<m;i++){
        if(i==2) res+=28+leap(y);
        else res+=md[i];
    }
    res+=d;
    return res;
}
int main(){
    ll b_days,a_days,start_val,end_val,next_start_val,curr_val;
    if(scanf("%lld%lld%lld",&ys,&ms,&ds)!=3) return 0;
    scanf("%lld%lld%lld",&ye,&me,&de);
    start_val=get_days(ys,ms,ds);
    end_val=get_days(ye,me,de);
    b_days=end_val-start_val+1;
    next_start_val=end_val+1;
    scanf("%lld",&q);
    while(q--){
        scanf("%lld%lld%lld",&y,&m,&d);
        curr_val=get_days(y,m,d);
        a_days=curr_val-next_start_val+1;
        if(a_days<b_days) printf("Less\n");
        else if(a_days==b_days) printf("Same\n");
        else printf("More\n");
    }
    return 0;
}