#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
P e() { return { 0,-1 }; }
P op(P a, P b) {
	if (a.second > b.second)swap(a, b);
	if (b.first)return b;
	else if (a.first) return a;
	return e();
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q; cin >> n >> q;
	vector<P>a(n);
	rep(i, n) {
		int x; cin >> x;
		if (x >= 2)a[i].first = 1;
		else a[i].first = 0;
		a[i].second = i;
	}
	segtree<P, op, e>seg(a);
	while (q--) {
		int t, x, y; cin >> t >> x >> y;
		x--;
		if (1 == t) {
			P na = { 0,x };
			if (y >= 2) na.first = 1;
			seg.set(x, na);
		}
		else {
			auto get = seg.prod(x, y);
			int val = y - x + 1;
			if (-1 != get.second) {
				val = (y - 1) - get.second;
			}
			if (0 == val % 2)cout << 'F' << endl;
			else cout << 'S' << endl;
		}
	}
	return 0;
}