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

int read()
{
	int x , f = 1;
	char ch;
	while( ( ch = getchar() ) < '0' || ch > '9' )
		if( ch == '-' ) f = -1;
	x = ch ^ 48;
	while( ( ch = getchar() ) >= '0' && ch <= '9' )
		x = ( x << 3 ) + ( x << 1 ) + ( ch ^ 48 );
	return x * f;
}

int a , b , c;

int main()
{
	a = read() , b = read() , c = read();
	if( ( c & 1 ) == 0 )
		a = abs( a ) , b = abs( b );
	putchar( a == b ? '=' : ( a < b ? '<' : '>' ) );
	return 0;
}
#include <bits/stdc++.h>
#include <unordered_map>
#define fast_io                                                                                                                \
    ios::sync_with_stdio(false);                                                                                               \
    cin.tie(0)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 998244353;

string helper(string s) {
	if (s.size() % 2 == 1) s += s;
	string ret;
	for (int i = 0; i < s.size(); i += 2) {
		if (s[i] == s[i + 1]) { ret += s[i]; }
		else {
			if ((s[i] == 'R'&&s[i + 1] == 'S') || (s[i + 1] == 'R'&&s[i] == 'S')) { ret += 'R'; }
			if ((s[i] == 'R'&&s[i + 1] == 'P') || (s[i + 1] == 'R'&&s[i] == 'P')) { ret += 'P'; }
			if ((s[i] == 'P'&&s[i + 1] == 'S') || (s[i + 1] == 'P'&&s[i] == 'S')) { ret += 'S'; }
		}
	}
	return ret;
}

int main() {
	int n,k;
	string s;
	cin >> n>> k;
	cin >> s;
	char ans;
	for (int i = 0; i < k; i++) {
		s = helper(s);
	}
	ans = s[0];
	cout << ans << endl;
	return 0;
}