#include #include using namespace std; typedef long long ll; struct BIT{ int N; vector vec; BIT(int N_): N(N_), vec(N + 1){ for (int i = 0; i < N + 1; i++){ vec[i] = 0; } } void add(int p, ll x){ for (int i = p; i <= N; i += (i & -i)){ vec[i] += x; } } ll sum(int p){ ll sum = 0; for (int i = p; i > 0; i -= (i & -i)){ sum += vec[i]; } return sum; } }; int main(){ int N, Q; cin >> N >> Q; vector A(N); for (int i = 0; i < N; i++){ cin >> A[i]; } BIT bit(N); for (int i = 0; i < N; i++){ if (A[i] == 1) bit.add(i + 1, 1); } for (int i = 0; i < Q; i++){ int T; cin >> T; if (T == 1){ int X, Y; cin >> X >> Y; if (A[X - 1] == 1 && Y != 1){ bit.add(X, -1); } else if (A[X - 1] != 1 && Y == 1){ bit.add(X, 1); } A[X - 1] = Y; } else{ int X, Y; cin >> X >> Y; ll sumY = bit.sum(Y); ll sumX = bit.sum(X - 1); if (Y - X + 1 == sumY - sumX){ if ((sumY - sumX) % 2 == 0){ cout << "S" << endl; } else{ cout << "F" << endl; } } else if (A[Y - 1] != 1){ cout << "F" << endl; } else{ //どこまで1であるかを二分探索 int left = X - 1; int right = Y; while(right - left > 1){ int center = (left + right) / 2; ll sumC = bit.sum(center); if (Y - center == sumY - sumC){ right = center; } else{ left = center; } } if ((Y - right) % 2 == 0){ cout << "F" << endl; } else{ cout << "S" << endl; } } } } }