package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;


public class Dancing_with_the_Googlers {
	public static void main(String[] args) throws IOException   
	  {  		 
		  FileInputStream fis;
		try {
			fis = new FileInputStream("B-large.in");
			InputStreamReader ir = new InputStreamReader(fis);
			BufferedReader br = new BufferedReader(ir);
			String s;int i=0;
			br.readLine();
			while (br.ready()) {
				i++;
				s = br.readLine();
				System.out.print("Case #"+i+": ");
				tran(s);
				System.out.print("\r");
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

		  //tran(a);
	  }   
	  static void tran(String a)
	  {
		  String num="";
		  int count=0;int N=0;int S=0;int P=0;
		  int[] score=new int[9999];
		  for(int i=0;i<a.length();i++)
		  {
			  if(Character.isDigit(a.charAt(i))&&i!=a.length()-1)
			  {
				  num=num+a.charAt(i);
			  }
			  else if(count==0)
			  {
				  N=Integer.parseInt(num);
				  num="";
				  count++;
			  }
			  else if(count==1)
			  {
				  S=Integer.parseInt(num);
				  num="";
				  count++;
			  }
			  else if(count==2)
			  {
				  P=Integer.parseInt(num);
				  num="";
				  count++;
			  }
			  else if(i==(a.length()-1))
			  {
				  num=num+a.charAt(i);				  
				  score[count-3]=Integer.parseInt(num);
			  }
			  else
			  {
				  score[count-3]=Integer.parseInt(num);
				  num="";
				  count++;
			  }	
		  }
		  //System.out.print(N+" "+S+" "+P+" ");
		  //for(int i=0;i<N;i++){System.out.print(score[i]+" ");}
		  int ans1=0,ans2=0,fin=0;
		  for(int i=0;i<N;i++)
		  {
			  if(score[i]>=P*3-2&&score[i]>=P){ans1++;}
			  else if(score[i]>=P*3-4&&score[i]>=P){ans2++;}			  
		  }
		  if(ans2<=S){fin=ans2+ans1;}
		  else{fin=S+ans1;}
		  System.out.print(fin);
	  }

}
