#include<bits/stdc++.h>
using namespace std;

///// Defines /////
#define FAST ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define f(i, beg, end) for(int i=beg; i<end; i++)
#define rf(i, beg, end) for(int i=beg; i>=end; i--)
#define ms(x, a) memset(x, a, sizeof(x))
#define Max(x, y, z) max(x, max(y, z))
#define Min(x, y, z) min(x, min(y, z))
#define max__(a, n) *max_element(a, a+n)
#define min__(a, n) *min_element(a, a+n)
#define endl '\n'
#define ln cout << '\n'
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define imp cout << "-1\n"
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define in insert
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sz(v) (int)v.size()
#define len length()
#define ub upper_bound
#define lb lower_bound

///// Data types and Containers /////
typedef long long ll;
typedef vector<int> vi;
typedef vector<int>::iterator viit;
typedef vector<char> vc;
typedef vector<char>::iterator vcit;

///// Constants /////
const long long MOD = 1e9+7;
const long long INF = LONG_LONG_MAX;
const long long MINF = LONG_LONG_MIN;
const int N = 2e5+5;

///// F(X)'s /////
template <typename T> inline T abs(T x) {return x < 0? -x : x;}
inline ll pow_mod(ll x,ll n) {ll r=1;while(n){if(n%2)r=(r*x)%MOD;x=(x*x)%MOD;n/=2;}return r;}
inline ll pow_(ll x,ll n) {ll r=1;while(n){if(n%2)r=(r*x);x=(x*x);n/=2;}return r;}

inline void solve()
{
    int n; cin >> n;
    int a[n]; 
    f(i,0,n) cin >> a[i];
    
    int i = 0, j = n-1, f = 1;
    while(i<=j) {
        if(f) cout << a[i++] << " ";
        else cout << a[j--] << " ";
        f ^= 1;
    }
    ln;
}

int main()
{
    FAST
    int t=1; cin >> t;
    while(t--) solve();
}