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 Dance
{
    public static void main(String zaga[]) throws FileNotFoundException
    {
        Scanner input = new Scanner(System.in);
        File file = new File("out.txt");
        PrintStream writer = new PrintStream(file);
        
        int T = input.nextInt();
        
        ArrayList<Integer> ans = new ArrayList<Integer>();
        
        for(int t = 0; t < T; t++)
        {
            int N = input.nextInt();
            
            int S = input.nextInt();
            
            int P = input.nextInt();
            
            ArrayList<Integer> scores = new ArrayList<Integer>();
            
            for(int i = 0; i < N; i++)
            {
                scores.add(input.nextInt());
            }
            
            int s = 1;
            
            for(int i = 0; i < scores.size(); i++)
            {   
                int num = scores.get(i);
                
                int first = P;
                
                if((scores.get(i) - P) >= P * 2 )
                {
                    continue;
                }
                
                if(scores.get(i) - P < 0)
                {
                    scores.remove(i);
                    --i;
                    continue;
                }
                
                if(((scores.get(i) - P) / 2) + 1 == P)
                {
                    continue;
                }
                
                if(num - P >= 0)
                {
                    int second = (num - P) / 2;
                    int third = second;
                    
                    if((num - P) % 2 == 1)
                    {
                        ++third;
                    }
                
                    if(second + 2 >= P && third + 2 >= P)
                    {
                        if(s <= S)
                        {
                            ++s;
                           continue;
                        }
                        else
                        {
                            scores.remove(i);
                            --i;
                            continue;
                        }
                    }
                    else
                    {
                        scores.remove(i);
                        --i;
                        continue;
                    }
                    
                }
                else
                {
                    scores.remove(i);
                    --i;
                    continue;
                }
            }
            
            ans.add(scores.size());
        }
        
        for(int i = 0; i < ans.size(); i++)
        {
            writer.print("Case #"+(i+1)+": "+ans.get(i));
            
            if(!(i + 1 == ans.size()))
            {
                writer.print("\n");
            }
        }
        
    }
}