#include <iostream>
#include <set>
#include <vector>
using namespace std;

int n, m;

int main()
{
	cin >> n >> m;
	vector<int> st = vector<int>(n+2, 0);
	st[0] = 11;
	st[n + 1] = 11;
	int prev = 0;
	for (int i = 0; i < m; i++) {
		int q;
		cin >> q;
		if(q==1){
			int r, l;
			cin >> l >> r;
			for (int i = l; i <= r; i++) {
				st[i] = 1 - st[i];
			}

		}
		else {
			int p;
			cin >> p;
			int l = p, r = p;
			while ( st[l-1]==st[p]) {
				l--;
			}
			while ( st[r + 1] == st[p]) {
				r++;
			}
			cout << st[p] << " " << l << " " << r<<'\n';

		}
	}


    return 0;
}