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

using LL=__int128_t;

ll f(ll A,ll B,ll C,ll N){
    
    ll L=0,R=N;
    while(R-L>1){
        ll M=(R+L)/2;
        ll BL=M/B;
        LL g=0;
        g+=LL(A)*LL(B)*LL(BL);
        g+=LL(B)*LL(BL)*LL(BL-1)/2*LL(C);
        LL hg=A+BL*C;
        g+=hg*(M%B);
        if(g>=N)R=M;
        else L=M;
    }
    return R;
}

int main(){
	ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll N;
    cin>>N;
    array<ll,2> U;
    for(int i=0;i<2;i++){
        ll A,B,C;
        cin>>A>>B>>C;
        U[i]=f(A,B,C,N);
    }
    if(U[0]==U[1])cout<<"Same\n";
    else if(U[0]<U[1])cout<<"KCPC\n";
    else cout<<"KUPC\n";
}