DSA02001 - DÃY SỐ 1

//Made By Phuong Nam PROPTIT <3//
#pragma GCC Optimize("O3")
#include<bits/stdc++.h>
#include<string>
#include<vector>
#define alphaa "abcdefghijklmnopqrstuvwxyz"
#define ALPHAA "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define f(i,a,b) for(int i=a;i<=b;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
#define f0(i,n) for(int i=0;i<n;i++)
#define ff(i,b,a) for(int i=b;i>=a;i--)
#define el cout<<'\n'
#define fi first
#define se second
#define pb push_back
#define pk pop_back
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(v) sort(v.begin(),v.end())
using namespace std;
typedef long long ll;
const int N=1e6+3;
const int MOD=1e9+7;
template<class X,class Y>
    void minimize(X &x,const Y &y) {
        if (x>y) x=y;
    }
template<class X,class Y>
    void maximize(X &x,const Y &y) {
        if (x<y) x=y;
    }
template<class T>
    T Abs(const T &x) {
        return (x<0?-x:x);
    }
int n,a[20],f[20];
void xuly()
{
    vector<vi>res;
    cin>>n;
    f1(i,n) cin>>a[i];
    int cot=n-1;
    vi v;
    f1(i,n) v.pb(a[i]);
    res.pb(v);
    f1(i,n-1)
    {
        v.clear();
        f1(j,cot) f[j]=a[j]+a[j+1],v.pb(f[j]);
        f1(j,cot) a[j]=f[j];
        res.pb(v);
        cot--;
    }
    f0(i,res.size())
    {
        cout<<'[';
        f0(j,res[i].size()-1) cout<<res[i][j]<<' ';
        cout<<res[i][res[i].size()-1]<<']'<<'\n';
    }
}
int main()
{
  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  int t;
  cin>>t;
  while(t--) xuly();
}
//-----YEU CODE HON CRUSH-----//