ylbZXZ - Online C++ Compiler & Debugging Tool

    #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;   // needed for tree + PBDS

#define pb push_back
#define all(x) x.begin(), x.end()
typedef long long ll;
const ll INF = (ll)1e18;
const ll MOD = 1000000000+7 ;
const double eps = 1e-9 ;
template <class T>
using ordered_set = tree<
    T,
    null_type,
    less<T>,
    rb_tree_tag,
    tree_order_statistics_node_update
>;

void solve() {
    ll q ; cin >> q ;
   // cout <<   q << endl ;
    ll  total = 0 , previous = 0 ;
    ll last = 0   , sz = 0 ;
    bool reversed = false ;
    deque < ll > dq ;
    while (q -- ) {
       // cout << "hh" << endl ;

        int s ; cin >> s ;
      //  cout << s <<"jj" << endl ;
        ll neww = 0 ;
        if (s == 1 ) {
            if (reversed) {
                last = dq.front();
            }
            else last = dq.back()  ;
            neww  =previous +(total-last)  -  last * (sz-1) ;
            previous = neww ;
            cout << neww << endl ;
            if (reversed  ) {
                ll x = dq.front() ;dq.pop_front() ;dq.push_back(x) ;
            }
            else {
                ll x = dq.back() ;  dq.pop_back() ;  dq.push_front(x) ;
            }
        }
        else if (s == 2 ) {
             neww = (sz +1 )* (total) - previous ;
            cout << neww << endl ;
            previous = neww ;
            reversed^=1 ;
        }
        else {
            ll k ; cin >> k ;
            sz++ ;
            neww = previous + k * sz ;
            if (reversed ) {
                dq.push_front(k) ;
            }
            else dq.push_back(k) ;
            total += k ;
            previous = neww ;
            cout << neww << endl ;
        }
    }
}


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    int t = 1 ; cin >> t;
    int maxi = 200000 + 5;

    while (t--) solve();
    return 0;
}