#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<map>
#include<queue>
#include<vector>
#define ll long long
#define LD double
#define eps 1e-9
#define PI acos(-1.0)
#define F first
#define S second
#define pb push_back
#define debug(x); cout<<"debug"<<x<<endl;
#define des(x); printf("des:%s\n",x+1);
const ll INF=0x3f3f3f3f3f3f3f3f;
const int inf=0x3f3f3f3f;
const ll mod=1e9+9;
using namespace std;
const int N=3e5+5;
int n,m;
int t;
int a[500];
int main()
{
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
		}
		int l=1;
		int r=n;
		while(l<=r)
		{
			printf("%d ",a[l]);
			l++;
			if(l>r)
				break;
			printf("%d ",a[r]);
			r--;
		}
		printf("\n");
	}
}