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

int n=1;
V k(202020);

void update(int i,int x){
    i+=n-1;
    k[i]=x;
    while(i){
        i=(i-1)/2;
        k[i]=k[i*2+1]+k[i*2+2];
    }
}

int query(int a,int b,int i,int l,int r){
    if(b<=l||r<=a) return 0;
    if(a<=l&&r<=b) return k[i];
    return query(a,b,i*2+1,l,(l+r)/2)+query(a,b,i*2+2,(l+r)/2,r);
}

int main(){
    int _n,q,count=0;
    cin >> _n >> q;
    while(n<=_n) n*=2;
    V a(_n);
    rep(i,_n){
        cin >> a[i];
        update(i,(a[i]==1));
    }
    rep(i,q){
        int t,x,y;
        cin >> t >> x >> y;
        if(t==1) update(x-1,(y==1));
        else if(query(x,y,0,0,n)%2) cout << "S" << endl;
        else cout << "F" << endl;
    }
}