#include<bits/stdc++.h>
using namespace std;
int in(){
    int x;
    scanf("%d",&x);
    return x;
}
char janken(char c1,char c2){
    if(c1>c2)swap(c1,c2);
    if(c1==c2)return c1;
    if(c1=='P' && c2=='R')return 'P';
    if(c1=='P' && c2=='S')return 'S';
    if(c1=='R' && c2=='S')return 'R';
}
int main(){
    int n=in(),k=in();
    string s;
    cin>>s;
    vector<int>v;
    int p=1;
    for(int i=0;i<=k;i++){
        v.push_back(p/n);
        p%=n;
        if(i<k)p*=2;
    }
    reverse(v.begin(),v.end());
    while(v.size() && v.back()==0)v.pop_back();
    int vs=v.size();
    string amari;
    for(int i=0;i<p;i++)amari.push_back(s[i]);
    for(int i=0;i<vs-1;i++){
        s+=s;
        if(v[i])amari=s+amari;
        string new_s,new_amari;
        for(int i=0;i<s.size()-1;i+=2)new_s.push_back(janken(s[i],s[i+1]));
        for(int i=0;i<(int)amari.size()-1;i+=2)new_amari.push_back(janken(amari[i],amari[i+1]));
        s=new_s;
        amari=new_amari;
    }
    if(vs)s=s+amari;
    else s=amari;
    int ss=s.size();
    vector<char>ans(ss*2);
    for(int i=0;i<ss;i++)ans[ss+i]=s[i];
    for(int i=ss-1;i;i--)ans[i]=janken(ans[i*2],ans[i*2+1]);
    cout<<ans[1]<<endl;
    return 0;
}
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long int
#define pii pair<ll,ll>
#define rep(i,st,en) for(ll i=st;i<en;i++)
#define repdown(i,st,en) for(ll i=st;en<i;i--)
#define vll vector<ll>
#define vd vector<double>
#define vb vector<bool>
#define vii vector<pii>
#define vp vector<pii>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define eb emplace_back
#define PI 3.14159265358979323846
#define ans(A) cout<<A<<endl;
#define ANS(A) cout<<A;
#define yes cout<<"Yes"<<endl;
#define no cout<<"No"<<endl;
#define resz(A,N) A.resize(N); 
#define vsortup(v) sort(all(v)) //1,2,3,4,5
#define vsortdown(v) sort(rall(v)) //5,4,3,2,1

vll enm_div(ll n); //約数リスト出力

int main()
{
    ll T;
    cin >> T;
    vll cs; resz(cs,T);
    ll odc=0,evc=0;
    rep(i,0,T)
        cin >> cs[i];
        // vll divlst = enm_div(cs[i]);
        // rep(j,0,divlst.size()){
        //     if (divlst[i]%2==0)//偶数
        //         evc++;
        //     else
        //         odc++;
        // }
    rep(i,0,T){
        if (cs[i]%4==0){
            ans("Even")
        }
        else{
            if (cs[i]%2==0){
                ans("Same");
            }
            else{
                ans("Odd")
            }
        }
    }
    
    
    return 0;
}
vll enm_div(ll n)
{
    vll prms;
    for (ll i = 1; i*i <= n; i++)
        if (n%i==0){
            prms.push_back(i);
            if (i != n/i)
                prms.push_back(n/i);
        }
    if (prms.size()==0)
        resz(prms,1);

    vsortup(prms);
    return prms;
}