package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

public class DancingWithGooglers {
	public static int[] numbers(int given, boolean check, int p) {
		int[] solution = new int[3];
		int []answer= new int[2];
		int num = given / 3;
		int mod = given % 3;

		solution[0] = num;
		int remain = given - num;
		int newN = remain / 2;
		solution[1] = newN;
		solution[2] = remain - newN;

		if (solution[0] >= p || solution[1] >= p || solution[2] >= p) {
			answer[0]=1;
			answer[1]=0;
			return answer;
		}
		
		if (check) {
			answer[1]=1;
			if ((mod == 0)&&num!=0) {
				solution[0] = num - 1;
				solution[1] = num;
				solution[2] = num + 1;

			} else if ((mod == 1)&&num!=0) {
				solution[0] = num - 1;
				solution[1] = num + 1;
				solution[2] = num + 1;
			} else if (mod == 2) {
				solution[0] = num;
				solution[1] = num;
				solution[2] = num + 2;
			}
		}
		
		if (solution[0] >= p || solution[1] >= p || solution[2] >= p) {
			answer[0]=1;
			
			return answer;
		}
		// System.out.println(solution[0]);
		// System.out.println(solution[1]);
		// System.out.println(solution[2]);
		answer[0]=0;
		answer[1]=0;
		return answer;
		
	}

	public static void solve(String fname) {
		Read r = new Read();
		r.Read(fname);
		String fAnswer="";
		int numOfTest = r.noOfTestCases;
		int[] numOfPlayers = r.N;
		int[] numOfSurprising = r.S;
		int[] ps = r.p;
		int[][] nums = r.all;
		
		for (int i = 0; i < numOfTest; i++) {
			int numOfP = numOfPlayers[i];
			int numOfS = numOfSurprising[i];
			int p = ps[i];
			int[] numsCurr = nums[i];
			int surprised = 0;
			
			int maxNumber = 0;
			for (int j = 0; j < numsCurr.length; j++) {
				if (surprised < numOfS) {
					int []num ;
					num = numbers(numsCurr[j], true, p);
					maxNumber = maxNumber + num[0];
					surprised = surprised + num[1];
				} else {
					int []num ;
					num= numbers(numsCurr[j], false, p);
					maxNumber = maxNumber + num[0];
					surprised = surprised + num[1];
				}
			}
			String ans = "Case #" + (i + 1) + ": " +maxNumber;
			
			fAnswer=fAnswer+ans+"\n";
		}
		System.out.println(fAnswer);
		r.write("out", fAnswer);
	}

	public static void main(String[] args) {
		solve("test");
	}
}
