B. Disjoint Sets Union 2

#include<bits/stdc++.h>
#define nl "\n"
#define fi first
#define se second
#define pi 3.14159
#define ll long long
#define odd(a)  (a&1)
#define even(a)  !(a&1)
#define Mod 1'000'000'007
#define INF 2'000'000'000
#define sz(x) int(x.size())
#define charToInt(s) (s - '0')
#define ull unsigned long long
#define number_line iota(all(vec) , 1)
#define all(s) s.begin(), s.end()
#define rall(v) v.rbegin() , v.rend()
#define fixed(n) fixed << setprecision(n)
#define Num_of_Digits(n) ((int)log10(n) + 1)
#define to_decimal(bin) stoll(bin, nullptr, 2)
#define Ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define Floor(n, m) (((n) / (m)) - ((n) % (m) ? 0 : 1))
#define Upper(s) transform(all(s), s.begin(), ::toupper);
#define Lower(s) transform(all(s), s.begin(), ::tolower);
#define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
//  ----- bits-------
#define pcnt(n) __builtin_popcount(n)
#define pcntll(n) __builtin_popcountll(n)
#define clz(n) __builtin_clz(n)    // <---100
#define clzll(n) __builtin_clzll(n)
#define ctz(n) __builtin_ctz(n)  // 0001---->
#define ctzll(n) __builtin_ctzll(n)

using namespace std;

template < typename T = int > istream& operator >> (istream &in, vector < T > & v){
    for(auto & x : v) in >> x;
    return in;
}

template < typename T = int > ostream& operator << (ostream &out, const vector < T > & v){
    for(const T & x : v) out << x << nl;
    return out;
}

void esraa()
{
    //freopen("shuffle.in", "r", stdin), freopen("shuffle.out", "w", stdout);
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}
int maxi = 0;
vector < set < int > > same_set;
struct DSU{
    vector < int > per , rank , group_size;
    int group_count;
    int min_el = 1e9 , max_el = 0;
    explicit DSU(int n){
        per.resize(n + 1);
        rank.resize(n + 1);
        group_size.resize(n + 1);
        group_count = n;
        iota(all(per) , 0);
        fill(all(rank) , 1);
        fill(all(group_size) , 1);
        same_set.resize(n + 1);
    }

    int get(int x){
        return (x == per[x] ? x : per[x] = get(per[x]));
    }

    void join(int u , int v){
        u = get(u);
        v = get(v);
        if(u == v) return;
        if(rank[u] < rank[v]) swap(u , v);
        per[v] = u;
        group_size[u] += group_size[v];
        maxi = max(maxi , group_size[u]);
        group_count--;
    }

    bool is_same_set(int u , int v){
        return get(u) == get(v);
    }
};
void solve(){
    int n , m;
    cin >> n >> m;
    DSU dsu(n);
    for(int i = 0; i < m; i++){
        string s;
        cin >> s;
        if(s == "union"){
            int u , v;
            cin >> u >> v;
            dsu.join(u , v);
            same_set[dsu.get(u)].insert(u);
            same_set[dsu.get(u)].insert(v);
        }
        else{
            int u;
            cin >> u;
            if(!same_set[dsu.get(u)].empty()){
                cout << *same_set[dsu.get(u)].begin() << " " << *same_set[dsu.get(u)].rbegin() << " " << dsu.group_size[dsu.get(u)] << nl;
            }
            else cout << u << " " << u << " " << dsu.group_size[dsu.get(u)] << nl;


        }
    }
}
int main()
{
    esraa();
    int t = 1;
    //cin >> t;
    //cin.ignore();
    while(t--)
      solve();
    return 0;
}