#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    string T;
    cin >> T;
    int N;
    cin >> N;
    int M = 100;
    int D = 32;
    vector p(M * 2, vector<int>(D + 1));
    auto xs = [&](unsigned int &st) -> void {
        st ^= (st << 13);
        st ^= (st >> 17);
        st ^= (st << 5);
    };
    rep(d, 0, D) {
        unsigned int st = (1u << d);
        rep(k, 0, M) {
            xs(st);
            if (st & 1) p[k * 2][d] = 1;
            if (st & 2) p[k * 2 + 1][d] = 1;
        }
    }
    string S = "RSPX";
    S += S;
    rep(k, 0, M) {
        rep(i, 0, 4) if (S[i] == T[k]) {
            if (i & 1) p[k * 2][D] = 1;
            if (i & 2) p[k * 2 + 1][D] = 1;
        }
    }
    rep(i, 0, D) {
        rep(j, i, M * 2) if (p[j][i]) swap(p[i], p[j]);
        rep(j, 0, M * 2) if (j != i && p[j][i]) {
            rep(k, 0, D + 1) p[j][k] ^= p[i][k];
        }
    }
    unsigned int tmp = 0;
    rep(i, 0, D) if (p[i].back()) tmp += (1u << i);
    rep(rp, 0, M) xs(tmp);
    rep(i, 0, N) {
        xs(tmp);
        cout << S[(tmp & 3) + 3];
    }
    cout << "\n";
}