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 static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.util.*;

public class B {
    int[][] allno=new int[31][2];
	Scanner sc;

	void solve(int caseID) {
    	int res=0;
    	int n=sc.nextInt();
    	int s=sc.nextInt();
    	int p=sc.nextInt();
    	int[] nos=new int[n];
    	for(int i=0;i<n;i++)
    	    nos[i] = sc.nextInt();
    	for(int i=0;i<n;i++)
    	{
        	if(allno[nos[i]][0]>=p)
        	  res++;
            else if(s>0 && allno[nos[i]][1]>=p)
            {
                res++;
                s--;
            }
        }
         System.out.println(""+res);
	}

	void run() {
		long time = System.currentTimeMillis();
     	update();
		sc = new Scanner(System.in);
		int caseN = sc.nextInt();
		for (int caseID = 1; caseID <= caseN; caseID++) {
			//double t = (System.currentTimeMillis() - time) * 1e-3;
			//if (!SAMPLE) System.err.printf("%03d/%03d %.3f/%.3f%n", caseID, caseN, t, t / (caseID - 1) * caseN);
			System.out.printf("Case #%d: ", caseID);
			solve(caseID);
			System.out.flush();
		}
	}

	void update()
	{
    	int rem;
    	int no;
        for(int i=1;i<=30;i++)
        {
            rem=i%3;
            no=i/3;
            switch(rem)
            {
                case 0:
                  allno[i][0]=no;
                  allno[i][1]=no+1;
                  break;
                case 1:
                  allno[i][0]=no+1;
                  allno[i][1]=no+1;
                  break;
                case 2:
                  allno[i][0]=no+1;
                  allno[i][1]=no+2;
                  break;
            }
        }
    }

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

	public static void main(String[] args) {
			try {
				System.setIn(new FileInputStream("B.in"));
				System.setOut(new PrintStream(new FileOutputStream("B.out")));
			} catch (IOException e) {
			}
		new B().run();
	}

}