using System;

public class Program

{

    public static void Main(String[] args)

        {

            var totalCases = Convert.ToInt16(Console.ReadLine());

            var N = new int[totalCases];

            var ai = new string[totalCases];

​

            for (var i = 0; i < totalCases; i++)

            {

                N[i] = Convert.ToInt32(Console.ReadLine());

                ai[i] = Console.ReadLine();

​

                var items = ai[i].Split(' ');

                var totalCount = 0;

                var intItems = new int[N[i]];

                for (var j = 0; j < N[i]; j++)

                {

                    intItems[j] = Convert.ToInt32(items[j]);

                    if (intItems[j] > 0)

                    {

                        totalCount += intItems[j];

                    }

                }

​

                var sequentialCount = MaxSubArraySum(intItems, 0, N[i] - 1, CheckifAllAreNegative(intItems));

                if (totalCount == 0)

                {

                    totalCount = sequentialCount;

                }

                Console.WriteLine(string.Format("{0} {1}", sequentialCount, totalCount));

            }

        }

​

​

        static int Max(int a, int b)

        {

            return a > b ? a : b;

        }

​

        static int Max(int a, int b, int c)

        {

            return Max(Max(a, b), c);

        }

​

        static bool CheckifAllAreNegative(int[] arr)

        {

            var flag = true;

            for (var i = 0; i < arr.Length; i++)

            {

                if (arr[i] > 0)

                {

                    flag = false;

                }

            }

            return flag;

        }

​

        static int MaxCrossingSum(int[] arr, int l, int m, int h, bool IsAllNegative)

        {

            var sum = 0;

            var leftSum = 0;

            for (var i = m; i >= l; i--)

            {

                sum = sum + arr[i];

                if (IsAllNegative || sum > leftSum)

                    leftSum = sum;

            }

​

            // Include elements on right of mid

            sum = 0;

            var rightSum = 0;

            for (var i = m + 1; i <= h; i++)

            {

                sum = sum + arr[i];

                if (CheckifAllAreNegative(arr) || sum > rightSum)

                    rightSum = sum;

            }

​

            // Return sum of elements on left and right of mid

            return leftSum + rightSum;

        }

​

​

        static int MaxSubArraySum(int[] arr, int l, int h, bool IsAllNegative)

        {

            // Base Case: Only one element

            if (l == h)

                return arr[l];

​

            // Find middle point

            var m = (l + h) / 2;

​

            /* Return maximum of following three possible cases

               a) Maximum subarray sum in left half

               b) Maximum subarray sum in right half

               c) Maximum subarray sum such that the subarray crosses the midpoint */

            var leftHalf = MaxSubArraySum(arr, l, m, IsAllNegative);

            var rightHalf = MaxSubArraySum(arr, m + 1, h, IsAllNegative);

            var crossing = MaxCrossingSum(arr, l, m, h, IsAllNegative);

            return Max(leftHalf,

                       rightHalf,

                       crossing);

        }

}