/* -*- coding: utf-8 -*-
 *
 * 2080.cc:  No.2080 Simple Nim Query - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

template <typename T>
struct BIT {
  int n;
  vector<T> bits;
  
  BIT() {}
  BIT(int _n) { init(_n); }

  void init(int _n) {
    n = _n;
    bits.assign(n + 1, 0);
  }

  T sum(int x) {
    x = min(x, n);
    T s = 0;
    while (x > 0) {
      s += bits[x];
      x -= (x & -x);
    }
    return s;
  }

  void add(int x, T v) {
    if (x <= 0) return;
    while (x <= n) {
      bits[x] += v;
      x += (x & -x);
    }
  }

  int lower_bound(T v) {
    int	k = 1;
    while ((k << 1) <= n) k <<=	1;
    int	x = 0;
    for	(; k > 0; k >>= 1)
      if (x + k <= n && bits[x + k] < v) {
        x += k;
        v -= bits[x];
      }
    return x + 1;
  }
};

/* global variables */

int as[MAX_N];
BIT<int> bit;

/* subroutines */

/* main */

int main() {
  int n, qn;
  scanf("%d%d", &n, &qn);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  bit.init(n);
  for (int i = 0; i < n; i++) {
    if (as[i] == 1) bit.add(i + 1, 1);
    else as[i] = 0;
  }

  while (qn--) {
    int t, x, y;
    scanf("%d%d%d", &t, &x, &y), x--;

    if (t == 1) {
      y = (y == 1) ? 1 : 0;

      if (as[x] != y) {
	if (as[x] == 1) bit.add(x + 1, -1);
	else bit.add(x + 1, 1);
	as[x] = y;
      }
    }
    else {
      int k0 = x - 1, k1 = y;
      int sy = bit.sum(y);
      while (k0 + 1 < k1) {
	int k = (k0 + k1) / 2;
	if (sy - bit.sum(k) != y - k) k0 = k;
	else k1 = k;
      }
      //printf("2 %d %d -> k0=%d\n", x, y, k1);

      int l = y - k1;
      if (x == k1) l++;
      if (! (l & 1)) puts("F");
      else puts("S");
    }
  }

  return 0;
}