#include <bits/stdc++.h>
using namespace std;
int n, K, p;
char s[11];
int calc(int x, int y) {
  printf("1 %d %d\n", x, y);
  fflush(stdout);
  scanf("%s", s + 1);
  return s[1] == 'T';
}
int find(int l, int r) {
  while (l < r) {
    int mid = (l + r) >> 1;
    if (calc(mid, mid + 1))
      r = mid;
    else
      l = mid + 1;
  }
  return l;
}
int main() {
  scanf("%d%d", &n, &K);
  p = find(1, n);
  int l = 1, r = p;
  while (l < r) {
    int mid = (l + r + 1) >> 1;
    if (calc(mid - 1, mid)) return printf("2 %d %d\n", p, find(l, mid - 1)), 0;
    l = mid;
  }
  l = p;
  r = n;
  while (l < r) {
    int mid = (l + r) >> 1;
    if (calc(mid + 1, mid)) return printf("2 %d %d\n", p, find(mid + 1, r)), 0;
    r = mid;
  }
  return 0;
}
