dsu-2

#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define tests int t; cin >> t; while(t--)
#define vll vector<ll>
#define vi vector<int>
#define pb push_back
using namespace std;

int p[(int)1e5+5], r[(int)1e5+5], mins[(int)1e5+5], maxs[(int)1e5+5];
ll sizes[(int)1e5+5];

int get(int u) {
    if(p[u] != u) {
        p[u] = get(p[u]);
    }
    return p[u];
}

void Union(int a, int b) {
    a = get(a);
    b = get(b);
    if(a == b) {
        return;
    }
    if(r[a] == r[b]) {
        r[a]++;
    }
    if(r[a] > r[b]) {
        p[b] = a;
        mins[a] = min(mins[a], mins[b]);
        maxs[a] = max(maxs[a], maxs[b]);
        sizes[a] += sizes[b];
    } else {
        p[a] = b;
        mins[b] = min(mins[a], mins[b]);
        maxs[b] = max(maxs[a], maxs[b]);
        sizes[b] += sizes[a];
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int n, m; cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        sizes[i] = 1; mins[i] = i; maxs[i] = i;
        p[i] = i; r[i] = 0;
    }
    while(m--) {
        string q; cin >> q;
        if(q == "union") {
            int u, v; cin >> u >> v;
            Union(u, v);
        } else {
            int u; cin >> u;
            u = get(u);
            cout << mins[u] << " " << maxs[u] << " " << sizes[u] << "\n";
        }
    }
    return 0;
}