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

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll N;
ll A,B,C;
ll D,E,F;

__int128 hoge(__int128 a,__int128 b,__int128 c,__int128 v) {
	__int128 sum=a*v;
	__int128 step=v/b;
	__int128 x=step*(step-1)/2*b+step*(v%b);
	if(sum>N) return N+1;
	if(x&&N/c>x) return N+1;
	return sum+c*x;
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	cin>>A>>B>>C;
	cin>>D>>E>>F;
	ll a=0,b=0;
	for(i=57;i>=0;i--) {
		if(hoge(A,B,C,a+(1LL<<i))<N) a+=1LL<<i;
		if(hoge(D,E,F,b+(1LL<<i))<N) b+=1LL<<i;
	}
	cout<<a<<" "<<b<<endl;
	if(a<b) cout<<"KCPC"<<endl;
	else if(a>b) cout<<"KUPC"<<endl;
	else cout<<"Same"<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}