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.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;


public class google_2 {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		FileInputStream fstream = new FileInputStream("D:/Rilsikane/Google2/src/B-large.in");
		 DataInputStream in = new DataInputStream(fstream);
		  BufferedReader br = new BufferedReader(new InputStreamReader(in));
		  String strLine;
		  String s="";
		  while ((strLine = br.readLine()) != null)   {
			   s+=(strLine);
			   s+="\n";
		  }
		String x ="2 1 1 8 0";  
		compute(s);
	}
	
	
	public static void compute(String x) throws IOException{
		String temp[] = x.split("\n");
		
		int size = Integer.parseInt(temp[0]);
		FileWriter fstream = new FileWriter("D:/Rilsikane/Google2/src/B-large_output.txt");
		  BufferedWriter out = new BufferedWriter(fstream);	
		for(int k=1;k<=size;k++){			
		int result = 0;
		int n  = 0;
		int s = 0;
		int p = 0;
		int[] score = new int[10];
		for(int j=0;j<temp[k].length();j++){
			
			String temp2[] =temp[k].split(" ");
			 n  = Integer.parseInt(temp2[0]);
			 s = Integer.parseInt(temp2[1]);
			 p = Integer.parseInt(temp2[2]);
			 score = new int[n];
		for(int i =0;i<n;i++){
			score[i]=Integer.parseInt(temp2[3+i]);
		}
		
			//System.out.println("Case #"+k+":" +result);
		}	
		System.out.println("Case #"+k+": "+calculate(n, s, p, score)+"\n");
		out.write("Case #"+k+": "+calculate(n, s, p, score)+"\n");
		
	}
		 out.close();
	}
	public static int calculate(int n, int s, int p,
			   int[] scores) {
			  int result = 0;

			  int index = 0;
			  for (int score : scores) {
			   int base = score / 3;
			   switch (score % 3) {
			   case 0:


			    if (base >= p) {
			     result++;
			    } else {
			     if (s > 0 && base > 0 && (base + 1) >= p) {
			      s--;
			      result++;
			     }
			    }
			    break;
			   case 1:

			    if (base >= p || base + 1 >= p) {
			     result++;
			    } else {
			     if (p > 0 && (base + 1) >= p) {
			      s--;
			      result++;
			     }
			    }

			    break;
			   case 2:

			    if (base >= p || base + 1 >= p) {
			     result++;
			    } else {
			     if (s > 0 && (base + 2) >= p) {
			      s--;
			      result++;
			     }
			    }
			    break;
			   }
			   index++;
			  }
//			  System.out.println("Result: " + result);

			  return result;
			 }

}
