package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

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

public class P2
{
    public static void main(String[] args) throws Exception
    {
        Scanner sc = new Scanner(new FileReader("B-large.in"));
        PrintWriter pw = new PrintWriter(new FileWriter("output.txt"));
        
        int cases = Integer.parseInt(sc.nextLine());
        int c = 0, temp = 0, us = 0;
        
        for (int i = 0; i < cases; i++)
        {
            int n = sc.nextInt(); // no. of googlers
            int s = sc.nextInt(); // no. of surprising
            int p = sc.nextInt(); // criterion
            us = 0; // used suprises
            c = 0; // googlers that pass the test
            
            for(int j = 0; j<n; j++)
            {
                temp = sc.nextInt();
                double q = (temp+0.0)/(3.0);
                // total = 4 (1 1 2) 1.33
                int t1 = ((int)Math.floor(q+(2.0/3.0)));
                int t2 = ((int)Math.floor(q+(4.0/3.0)));
                if(temp < p)
                {
                    continue;
                }
                else if(q >= p || t1 >= p)
                {
                    c++;
                    continue;
                }
                // total = 5 (1 1 3) 1.66  
                else if(us != s && t2 >= p)
                {
                    c++;
                    us++;
                    continue;
                }
            }
            
            pw.println("Case #" + (i + 1) + ": " + c);
        }
        
        pw.close();
        sc.close();
    }
}

// ((temp+1)/n)+ 1 >= p
// ((temp+1)/n) >= p
// q+1 >= p