import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

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

import java.util.LinkedList;

/**
 *
 * @author Student
 */
public class Best {

    public static LinkedList<Score> scores(int som) {
        LinkedList<Score> res = new LinkedList<Score>();
        int x = som / 3;
        switch (som % 3) {
            case 0: {
                res.add(new Score(x, x, x,!true));
                res.add(new Score(x - 1, x + 1, x,!false));
                break;
            }
            case 1: {
                res.add(new Score(x, x, x + 1,!true));
                res.add(new Score(x - 1, x + 1, x + 1,!false));
                break;
            }
            case 2: {
                res.add(new Score(x, x, x+2,!false));
                res.add(new Score(x, x + 1, x+1,!true));
                break;
            }
        }
        if(!res.getFirst().isValid()) res.removeFirst();
        if(!res.getLast().isValid()) res.removeLast();
        return res;
    }
    
    public static int opt(int n,int s,int p,LinkedList<Integer> l){
        LinkedList<Score> lg=new LinkedList<>();
        int restofs=s;
        for(Integer i:l){
            LinkedList<Score> xxx=scores(i);
            switch(xxx.size()){
                case 1: {
                     if(xxx.getFirst().isbetter(p)) lg.add(xxx.getFirst());
                    break;
                }
                    
                case 2: {
                    if(xxx.getFirst().isSurprising()){
                        if(xxx.getFirst().isbetter(p)&& restofs!=0&&!xxx.getLast().isbetter(p)){
                        lg.add(xxx.getFirst());
                        restofs--;
                        break;
                        }
                    }
                    if(xxx.getLast().isSurprising()){
                        if(xxx.getLast().isbetter(p)&& restofs!=0&&!xxx.getFirst().isbetter(p)){
                        lg.add(xxx.getLast());
                        restofs--;
                        break;
                        }
                    }
                   if(xxx.getLast().isbetter(p)&&!xxx.getLast().isSurprising()){
                        lg.add(xxx.getLast());
                        break;
                   }
                   if(xxx.getFirst().isbetter(p)&&!xxx.getFirst().isSurprising()){
                        lg.add(xxx.getFirst());
                        break;
                   }
                    }
                }

            }
       
        return lg.size();
        
    }
}