/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		// TODO Auto-generated method stub
		
		File fi = new File("D:\\B-small-attempt0.in");
		Scanner in=new Scanner(fi);
		int c=in.nextInt();
		int goo=0;
		int sup=0;
		int p=0;
		int ans=0;
		for(int co=1;co<=c;co++){
	   goo=in.nextInt();
	      sup=in.nextInt();
	      p=in.nextInt();
	      int base=0;
	      int score=0;
	      int z[] ={0,0,0};
		for(int i=0;i<goo;i++){
			score=in.nextInt();
			base=score/3;
			switch(score%3)
			{
			case 0: 
			{
			z[0]=base-1;
			z[1]=base;
			z[2]=base+1;
			
			if(base >=p){
				ans++;
				}
			else
			{
				if(sup>0 && base >0 && (base+1)>=p){
					ans++;
					sup--;
				}
				
			}					
			break;
			}
			case 1:
			{
			if(base >=p||(base+1)>=p){
			ans++;	
			}	
			else{
				if(sup>0&&(base+1)>=p){
					ans++;
					sup--;
				}
			}
			
			
				break;
			}
			case 2:{
				if ((base + 1) >= p|| base >= p){
					ans++;
				} else {
					if(sup>0&&(base+2)>=p){
						ans++;
						sup--;
					}
				}
				
			
			
					
			break;		
			
		}	}	
		}System.out.println("Case #"+co+": "+ans);
ans=0;
	}
	}
	}


