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.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.StringTokenizer;

public class Dancing {
	
	static int N, S, p;
	static int[] t;
	
	public static void main(String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new FileReader("dancing.in"));
		int tc = Integer.parseInt(reader.readLine());
		String line;
		StringTokenizer st;
		for (int c = 1; c <= tc; c++) {
			line = reader.readLine();
			st = new StringTokenizer(line);
			N = Integer.parseInt(st.nextToken());
			S = Integer.parseInt(st.nextToken());
			p = Integer.parseInt(st.nextToken());
			t = new int[N];
			for (int i = 0; i < N; i++) {
				t[i] = Integer.parseInt(st.nextToken());
			}
			System.out.println("Case #"+c+": "+solve());
		}
	}

	static int solve(){
		boolean[] puedeSolo = new boolean[N];
		for (int i = 0; i < N; i++) {
			int k = t[i]/3;
			if (t[i]%3==0 && k>=p) puedeSolo[i]=true;
			if (t[i]%3!=0 && k+1>=p) puedeSolo[i]=true;
		}

		boolean[] puedeSorpresa= new boolean[N];
		for (int i = 0; i < N; i++) {
			int k = t[i]/3;
			if (t[i]%3==2 && k+2>=p) puedeSorpresa[i]=true;
			if (t[i]>=2 && t[i]%3<2 && k+1>=p) puedeSorpresa[i]=true;
		}
		
		int cps = 0;
		for (int i = 0; i < N; i++) {
			if (puedeSolo[i]) cps++;
		}
		
		int cpsor = 0;
		for (int i = 0; i < N; i++) {
			if (!puedeSolo[i] && puedeSorpresa[i]) cpsor++;
		}
		
		return Math.min(cps+cpsor, cps + S);
	}
	
}
