import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

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

public class ProblemB
{
	public static void main(String[] args) throws Exception
	{
		final String base = "B-small-attempt2";
		BufferedReader reader = new BufferedReader(new FileReader(base+".in"));
		BufferedWriter writer = new BufferedWriter(new FileWriter(base+".out"));
		reader.readLine();
		int place = 0;
		while (reader.ready())
		{
			String[] strs = reader.readLine().split(" ");
			int[] totals = new int[strs.length-3];
			int surprise = Integer.parseInt(strs[1]);
			int min = Integer.parseInt(strs[2]);
			for (int i=3;i<strs.length;i++)
				totals[i-3]=Integer.parseInt(strs[i]);
			int num = solve(surprise,min,totals);
			writer.write("Case #" + (++place) + ": " + num+'\n');
		}
		writer.close();
		reader.close();
	}

	public static int solve(int surprise, int min, int[] totals)
	{
		int number = 0;
		outer:
		for (int i=0;i<totals.length;i++)
		{
			int total = totals[i];
			boolean sur = false;
			for (int a=0;a<=10;a++)
			{
				for (int b=a;b<=a+2 && b<=10;b++)
				{
					int c = total - a - b;
					if (c<=10 && c>=min && a+2>=c && c>=b)
					{
						if (b==a+2||c==a+2)
							sur=true;
						else
						{
							number++;
							continue outer;
						}
					}
				}
			}
			if (sur && surprise>0)
			{
				number++;
				surprise--;
			}
		}
		return number;
	}

	public static int brute(int surprise, int min, int[] totals)
	{
		int number = 0;
		outer:
		for (int total : totals)
		{
			boolean sur = false;
			for (int a=1;a<=10;a++)
			{
				for (int b=1;b<=10;b++)
				{
					for (int c=1;c<=10;c++)
					{
						if (a+b+c!=total)
							continue;
						int maxDiff = Math.max(Math.abs(a-b), Math.max(Math.abs(a-c), Math.abs(b-c)));
						int max = Math.max(a, Math.max(b,c));
						if (max>=min)
						{
							if (maxDiff<2)
							{
								number++;
								continue outer;
							}
							else if (maxDiff==2)
							{
								sur=true;
							}
						}
					}
				}
			}
			if (sur && surprise>0)
			{
				number++;
				surprise--;
			}
		}
		return number;
	}
}
