import sys
readline = sys.stdin.readline

class Fenwick_Tree:
    def __init__(self, n):
        self._n = n
        self.data = [0] * n
 
    def add(self, p, x):
        assert 0 <= p < self._n
        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p
 
    def sum(self, l, r):
        assert 0 <= l <= r <= self._n
        return self._sum(r) - self._sum(l)
 
    def _sum(self, r):
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r
        return s
    
    def get(self, k):
        k += 1
        x, r = 0, 1
        while r < self._n:
            r <<= 1
        len = r
        while len:
            if x + len - 1 < self._n:
                if self.data[x + len - 1] < k:
                    k -= self.data[x + len - 1]
                    x += len
            len >>= 1
        return x

N, Q = map(int, readline().split())
A = list(map(int, readline().split()))
BIT = Fenwick_Tree(N)
for i in range(N):
    if A[i] == 1:
        BIT.add(i, 1)

for _ in range(Q):
    T, X, Y = map(int, readline().split())
    X -= 1
    if T == 1:
        if A[X] == 1:
            BIT.add(i, -1)
        if Y == 1:
            BIT.add(i, 1)
        A[X] = Y
    else:
        v = BIT.sum(X, Y)
        if v == Y - X:
            print("F") if v % 2 else print("S")
        else:
            if A[Y - 1] != 1:
                print("F")
            else:
                yes = Y - 1
                no = X
                while yes - no != 1:
                    mid = (yes + no)//2
                    if BIT.sum(mid, Y) == Y - mid:
                        yes = mid
                    else:
                        no = mid
                print("F") if (Y - yes) % 2 == 0 else print("S")