// Arup Guha
// 8/17/2014
// Solution to 2014 UCF Locals Problem: Dirty Plates

import java.util.*;
import java.io.*;

public class dirty {

	final public static int UNSOLVED = -1;

	public static void main(String[] args) throws Exception {

		Scanner stdin = new Scanner(new File("dirty.in"));
		int numCases = stdin.nextInt();

		// Process each case.
		for (int loop=1; loop<=numCases; loop++) {

			// Read in input.
			int clean = stdin.nextInt();
			int oneside = stdin.nextInt();
			int dirty = stdin.nextInt();

			// Solve and output.
			System.out.println("Scenario #"+loop+": "+solve(clean, oneside, dirty));
		}
	}

	public static int solve(int clean, int oneside, int dirty) {

		// Everything is dirty
		if (clean == 0 && oneside == 0)
			return 0;

		// Count surfaces
		int numSurfaces = 2*clean + 2*oneside + 2*dirty + 1;
		int numDirty = 2*dirty + oneside;
		if (oneside%2 == 1) numDirty++;
		else if (oneside == 0 && dirty > 0) numDirty += 2;

		// Basically, the number of dirty sides after each iteration must be even except the last.
		return (numSurfaces - numDirty + 1)/2;
	}
}