#include <iostream>
//#include<atcoder/all>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> 
#include <vector>
#include <algorithm>
#include <utility> 
#include <tuple> 
#include <cstdint> 
#include <cstdio> 
#include <map> 
#include <queue>
#include <set> 
#include <stack> 
#include <deque> 
#include <unordered_map> 
#include <unordered_set>
#include <bitset> 
#include <cctype>
//using namespace atcoder;
using namespace std;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<pair<ll, ll>>>;
vector<bool> seen;
bool C = true;
vector<ll> dist;
ll mod = 998244353;


int main() {

	ll N,Q;
	string S, T;
	cin >> N >> S >> T>>Q;
	rep(q, Q) {
		char C, Y;
		ll X;
		cin >> C >> X >> Y;
		if (C == 'S') {
			S[X - 1] = Y;
		}
		else {
			T[X - 1] = Y;
		}
		if (S < T)cout << "<" << endl;
		else if (S == T)cout << "=" << endl;
		else cout << ">" << endl;
	}
}