#include #include short int c[100000]; unsigned long int is[100000], js[100000], vs[100000], n, m, k = 0; void Count(unsigned long int); int main() { unsigned long int i, j, a, b; short int t; scanf("%lu%lu", &n, &m); Init(); for (i = 0; i < m; i++) { scanf("%hd", &t); if (t == 1) { scanf("%lu%lu", &a, &b); for (j = a - 1; j < b; j++) { c[j] = 1 - c[j]; } } else if (t == 2) { scanf("%lu", &a); Count(a-1); } } for (i = 0; i < k; i++) printf("%lu %lu %lu\n", vs[i], is[i], js[i]); return 0; } void Count(unsigned long int a) { k += 1; int i = a; while ((i > 0) && (c[i-1] == c[i])) i -= 1; is[k-1] = i + 1; while ((a < n - 1) && (c[a] == c[a+1])) a += 1; js[k-1] = a + 1; vs[k-1] = c[a]; } void Init() { int i; for (i = 0; i < n; i++) c[i] = 0; }