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();
	}
}

import java.util.Scanner;
public class Dancing {
	private static boolean isValidScore(int score) {
		return score >=0 && score <= 10;
	}
	private static boolean canReach (int tot, int p, boolean canSurprise) {
		int n = tot / 3;
		int a,b,c;
		a = n;
		b = n;
		c = tot - a - b;
		int max = -1;
		if (a==c) {
			//a-1, a, a+1
			if (isValidScore(a-1) && isValidScore(a) && isValidScore(a+1) && canSurprise) {
				max = a+1;
			}
			//a, a, a
			else if (isValidScore(a)) max = a;
		}
		if (a+1 == c) {
			//a, a, a+1
			if (isValidScore(a) && isValidScore(a+1)) max = a+1;
		}
		if (a+2 == c) {
			//a, a, a+2
			if (isValidScore(a) && isValidScore(a+2) && canSurprise) max = a+2;
			//a, a+1, a+1
			else if (isValidScore(a) && isValidScore(a+1)) max = a+1;
		}
		return max >= p;
	}
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for (int i=0; i < T; i++) {
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int numCanReach = 0;
			for (int j=0; j < N; j++) {
				int tot = in.nextInt();
				if (canReach(tot, p, false)) numCanReach++;
				else if (canReach(tot,p, true) && S != 0) {
					numCanReach++;
					S--;
				}
			}
			System.out.println("Case #"+(i+1)+": "+numCanReach);
		}
	}
}
