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


public class Dancing_Googlers {
	public static void main(String args[]) throws Exception
	{
		FileWriter ofstream = new FileWriter("outp.out");
		  BufferedWriter out = new BufferedWriter(ofstream);
			  FileInputStream fstream = new FileInputStream("inp.in");
			  DataInputStream in = new DataInputStream(fstream);
			  BufferedReader br = new BufferedReader(new InputStreamReader(in));
			 long n,sur,p,ng,rem;
			int i,ans=0;
			 int countn=1;
			  String strLine;
			  long[] li = new long[250];
				String[] ls = new String[250];
			  strLine = br.readLine();
			  n = Long.parseLong(strLine);
			  while ((strLine = br.readLine()) != null)   {
				  ans=0;
				  ls =   strLine.split(" ");
				  for (i=0;i<ls.length;++i)
					{
						li[i] = Long.parseLong(ls[i]);
					}
				  i=0;
				  ng =li[i] ;
				  ++i;
				  sur = li[i];
				  ++i;
				  p = li[i];
				  ++i;
				  //System.out.println ("n=" +n);
				  //System.out.println ("ng="+ng);
				  //System.out.println ("Sur="+sur);
				  //System.out.println ("p="+p);
				  for(;i<=(ng+2);i++)
				  {
					  //System.out.println (li[i]);
					  if(li[i]<p)  //Eliminating lower values
						  continue;
					  if((li[i]/3)>=p)   //Finalizing stage 1
					  {
						  //System.out.println ("Hello thier " + (li[i]/3));
						  ++ans;	
						  continue;
					  }
					  //Without Surprise
					  rem = li[i]-(2*p);
				      if(((rem)+1) == p || ((rem)-1) == p || ((rem)+2) == p || ((rem)-2) == p)
				      {
				    	  ++ans;
				    	  continue;
				      }
				    //With SUrprise	
				      rem = (li[i]-p)/2;
				      if(sur>0)
				      {
				    	  if((rem==p) || ((rem+2)==p) || ((rem-2)==p))
				    			  {
				    		         --sur;
				    		         ++ans;
				    			  }
				      }
				  }
				  System.out.println (ans);
				  out.write("Case #" +countn + ": " +ans + "\n");
				  ++countn;
			  }
			  in.close();	
			  out.close();
	}
}
