using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); public static void Main() { Solve(); } static void Solve() { var t = NN; var ans = new int[t][]; for (var u = 0; u < t; ++u) { var a = NList; var b = NList; ans[u] = new int[] { GetMin(a[0], a[1], a[2], b[0], b[1], b[2]), Math.Min(a[0], b[1]) + Math.Min(a[1], b[2]) + Math.Min(a[2], b[0]), }; } WriteLine(string.Join("\n", ans.Select(ai => string.Join(" ", ai)))); } static int GetMin(int a0, int a1, int a2, int b0, int b1, int b2) { var ans = int.MaxValue; Permutate(6, list => { var min = a0 + a1 + a2; var na0 = a0; var na1 = a1; var na2 = a2; var nb0 = b0; var nb1 = b1; var nb2 = b2; foreach (var li in list) { switch (li) { case 0: Rem(ref min, ref na0, ref nb0); break; case 1: Rem(ref min, ref na1, ref nb0); break; case 2: Rem(ref min, ref na1, ref nb1); break; case 3: Rem(ref min, ref na2, ref nb1); break; case 4: Rem(ref min, ref na2, ref nb2); break; default: Rem(ref min, ref na0, ref nb2); break; } } ans = Math.Min(ans, min); }); return ans; } static void Rem(ref int min, ref int a, ref int b) { var r = Math.Min(a, b); min -= r; a -= r; b -= r; } static void Permutate(int n, Action action) { var seed = new int[n]; for (var i = 0; i < n; ++i) seed[i] = i; var used = new bool[n]; var perm = new int[n]; Permutate(0, seed, perm, used, action); } static void Permutate(int pos, int[] seed, int[] perm, bool[] used, Action action) { if (pos == used.Length) action(perm); for (var i = 0; i < used.Length; ++i) { if (used[i]) continue; perm[pos] = seed[i]; used[i] = true; Permutate(pos + 1, seed, perm, used, action); used[i] = false; } } }