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

public class Dancing {

  public static void main(String[] args) throws FileNotFoundException, IOException {
    Scanner input = new Scanner(new File(args[0]));
    Scanner lin;
    int lines = 0;
    
    if (input.hasNextInt()) {
      lines = input.nextInt();
      input.nextLine();
    }
    
    String nLine;
    
    PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
    
    int googlers, surprising, p;
    int divThree, rem, cases, surprisingCases, answer;
    int[] points;

    for (int i = 0; i < lines; i++) {
      nLine = input.nextLine();
      lin = new Scanner(nLine);
      out.print("Case #" + (i + 1) + ": ");
      
      googlers = lin.nextInt();
      surprising = lin.nextInt();
      p = lin.nextInt();
      points = new int[googlers];
      for (int j = 0; j < googlers; j++) {
        points[j] = lin.nextInt();
      }
      
      cases = 0;
      surprisingCases = 0;
      
      for (int k = 0; k < googlers; k++) {
        divThree = points[k] / 3;
        rem = points[k] % 3;
        if (rem == 0) {
          if (divThree >= p)
            cases++;
          else if (divThree + 1 >= p && divThree != 0)
            surprisingCases++;
        }
        else if (rem == 1) {
          if (divThree + 1 >= p)
            cases++;
        }
        else if (rem == 2) {
          if (divThree + 1 >= p)
            cases++;
          else if (divThree + 2 >= p)
            surprisingCases++;
        }
      }
      
      if (surprisingCases >= surprising) {
        answer = surprising;
      }
      else {
        answer = surprisingCases;
      }
      answer += cases;
        
      out.println(answer);
    }
    
    out.close();
  
  }

}