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.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;
			 }

}
