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.*;
import java.lang.*;
import java.math.*;
import java.io.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;

public class B{
	Scanner sc=new Scanner(System.in);

	int INF=1<<28;
	double EPS=1e-9;

	int caze, T;
	int n, s, p;
	int[] ts;

	void run(){
		T=sc.nextInt();
		for(caze=1; caze<=T; caze++){
			n=sc.nextInt();
			s=sc.nextInt();
			p=sc.nextInt();
			ts=new int[n];
			for(int i=0; i<n; i++){
				ts[i]=sc.nextInt();
			}
			solve();
		}
	}

	void solve(){
		int count1=0, count2=0, count3=0;
		for(int i=0; i<n; i++){
			int t=ts[i];
			int max1, max2;
			if(t%3==0){
				max1=t/3;
				if(t>=3){
					max2=t/3+1;
				}else{
					max2=t/3;
				}
			}else if(t%3==1){
				max1=max2=t/3+1;
			}else{
				max1=t/3+1;
				max2=t/3+2;
			}
			max2=min(max2, 10);
			if(max1<p&&max2<p){
				count1++;
			}else if(max1<p&&max2>=p){
				count2++;
			}else{
				count3++;
			}
			// debug(t, max1, max2, p);
		}
		int ans=count3+min(count2, s);
		answer(ans+"");
	}

	void answer(String s){
		println("Case #"+caze+": "+s);
	}

	void println(String s){
		System.out.println(s);
	}

	void print(String s){
		System.out.print(s);
	}

	void debug(Object... os){
		System.err.println(deepToString(os));
	}

	public static void main(String[] args){
		try{
			System.setIn(new FileInputStream("dat/B-small.in"));
			System.setOut(new PrintStream(new FileOutputStream(
					"dat/B-small.out")));
		}catch(Exception e){}
		new B().run();
		System.out.flush();
		System.out.close();
	}
}
