To my dear brother

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;

int main()
{
    int sta = 0, number = 0, rev = 0;
    cin >> sta >> number >> rev;
    int tempList = 0;
    if (number == 0 || rev > number)return 0;
    int start_list[100100] = { 0 };
    int my_add[100100] = { 0 }, end_list[100100] = { 0 };
    for (int i = 0; i < number; i++)
    {
        cin >> tempList;
        cin >> my_add[tempList] >> end_list[tempList];
    }
    int index = 0;
   while(end_list[sta]!=-1)
    {
        start_list[index++] = sta;
        sta = end_list[sta];
    }
    int temp = 0;
    for (int i = 0; i <index - index % rev; i += rev)
    {
        int t_start = i, t_end = i+rev-1;
        while(t_start<t_end)
        {
            temp = start_list[t_start];
            start_list[t_start] = start_list[t_end];
            start_list[t_end] = temp;
            t_start++;
            t_end--;

        }
    }

    for (int i = 0; i < index-1; i++)
    {
        cout << start_list[i] << my_add[start_list[i]] << start_list[i+1] << endl;
    }
    cout << start_list[index - 1] << my_add[start_list[index - 1]] << "-1" << endl;

    return 0;
}