#include<bits/stdc++.h>

using namespace std;

#define Fopen freopen("_in.txt","r",stdin); freopen("_out.txt","w",stdout);

#define LL long long

#define ULL unsigned LL

#define fi first

#define se second

#define pb push_back

#define lson l,m,rt<<1

#define rson m+1,r,rt<<1|1

#define lch(x) tr[x].son[0]

#define rch(x) tr[x].son[1]

#define max3(a,b,c) max(a,max(b,c))

#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;

const int inf = 0x3f3f3f3f;

const int _inf = 0xc0c0c0c0;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const LL _INF = 0xc0c0c0c0c0c0c0c0;

const LL mod =  (int)1e9+;

const int N = 2e5 + ;

char s[N];

int solve(int l, int r){

    while(l != r){

        int mid1 = l+r >> ;

        int mid2 = mid1 + ;

        printf("1 %d %d\n", mid2, mid1);

        fflush(stdout);

        scanf("%s", s);

        if(s[] == 'T') l = mid2;

        else  r = mid1;

    }

    return l;

}

int solve2(int l, int r){

    while(l != r){

        int mid1 = l+r >> ;

        int mid2 = mid1+;

        if((l+r)% == ){

            mid1--;

            mid2--;

        }

        printf("1 %d %d\n", mid1, mid2);

        fflush(stdout);

        scanf("%s", s);

        if(s[] == 'T') r = mid1;

        else  l = mid2;

    }

    return l;

}

int main(){

    int n, k;

    scanf("%d%d", &n, &k);

    int p1 = solve(, n);

    int p2 = solve2(, p1);

    int p3 = solve(p1, n);

    int a[] = {p1, p2, p3};

    sort(a, a+);

    printf("2 %d %d\n", a[], a[]);

    fflush(stdout);

    return ;

}