#include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using V = vector<int>;

int main()
{
    int x, y, z;
    cin >> x >> y >> z;

    int a = 0;

    while (x*a < y*z) {
        ++a;
    }
    --a;

    cout << a << endl;
    return 0;
}
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const long long MOD = 1000000007;

ll n, k;
string s;
char dp[200][200];
ll pow2[200];

char winner(char a, char b){
    if(a == 'R') return (b == 'S' ? a : b);
    else if(a == 'P') return (b == 'R' ? a : b);
    else return (b == 'P' ? a : b);
}

char dfs(ll pos, ll len){
    if(dp[pos][len]) return dp[pos][len];
    if(len == 0) return s[pos];
    return dp[pos][len] = winner(dfs(pos, len - 1), dfs((pos + pow2[len - 1]) % n, len - 1));
}

signed main(){
    cin >> n >> k >> s;
    pow2[0] = 1;
    REP(i, n) pow2[i + 1] = (pow2[i] * 2) % n;
    PRINT(dfs(0, k));
    return 0;
}