#include <iostream>

#include <stack>

using namespace std;

int main()

{

    int n;

    char Record[];  // 广义表记录

    stack<char> A;

    cin >> n;

    for ( int i = ; i < n; ++i )

    {

        int Size, Index = -;

        int Count1 = , Count2;

        cin >> Size;

        for( int j = ; j < Size; ++j )

        {

            int W = , IsMatch = ;

            cin >> Count2;

            for ( int k = ; k < Count2 - Count1; ++k )

                A.push('(');

            while ( IsMatch ==  )

            {

                if ( A.top() == ')' )

                {

                    A.pop();

                    W += Record[Index--];

                }

                else

                {

                    A.pop();

                    IsMatch = ;

                }

            }

            A.push(')');

            Record[++Index] = W;

            Count1 = Count2;

            printf("%d ", W );

        }

        printf( "\n" );

    }

    return ;

}