import java.util.List;


public class Case implements Runnable {

	private int id;
	private String output;

	private int n;
	private int s;
	private int p;
	private List<Integer> g;

	public Case(int id) {
		this.id = id;
	}

	public Case(int id, int n, int s, int p, List<Integer> g) {
		super();
		this.id = id;
		this.n = n;
		this.s = s;
		this.p = p;
		this.g = g;
	}

	public String solve() {
		int res = 0;
		for (int googler : g) {
			int b = googler / 3;
			boolean div = googler % 3 == 0;
			if (b >= p) {
				res++;
				continue;
			}
			if (p == b+1) {
				if (div && s > 0 && b > 0) {
					res++;
					s--;
					continue;
				}
				if (!div) {
					res++;
					continue;
				}
			}
			if (p == b+2) {
				if (3*b+2 == googler && s > 0) {
					res++;
					s--;
				}
			}
		}
		return String.valueOf(res);
	}

	@Override
	public void run() {
		output = solve();
	}

	@Override
	public String toString() {
		return "Case #" + id + ": " + output;
	}

}
import java.util.Scanner;
import java.io.File;
import java.io.FileWriter;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.FileNotFoundException;

public class Dance {

	public static void main(String[] args) 
	{
		File f = new File("B-small-attempt0.in");
		try
		{
			Scanner scan = new Scanner(f);
			
			int lines = Integer.parseInt(scan.nextLine());
			FileWriter fstream = new FileWriter("output.txt");
			BufferedWriter out = new BufferedWriter(fstream);
						
			for(int i=0; i<lines; i++)
			{
				String line = scan.nextLine();
				String[] parts = line.split(" ");
				int N = Integer.parseInt(parts[0]);
				int S = Integer.parseInt(parts[1]);
				int p = Integer.parseInt(parts[2]);
				int[] totals = new int[N];
				for(int j=3;j<3+N;j++)
					totals[j-3] = Integer.parseInt(parts[j]);
				int num = solve(N,S,p,totals);
				out.write("Case #"+(i+1)+": "+num);
				out.newLine();
			}
			out.close();
		}
		catch(FileNotFoundException e)
		{
			e.printStackTrace();
		}
		catch(IOException ex)
		{
			ex.printStackTrace();
		}
		
	}

	private static int solve(int n, int s, int p, int[] totals) 
	{
		int count = 0;
		int countS = 0;
		for(int i: totals)
		{
			if(i>3*(p-1))
				count++;
			else if(countS < s && i>0 && (i==3*(p-1) || i==3*(p-1)-1))
			{
				count++;
				countS++;
			}
				
		}
		return count;
	}

}






