/*
 * 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);
        }


    }
}

package common;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.LinkedList;
import java.util.Queue;

public class FileTranslatorBasis {

	private int numOfCase;
	private File file;
	Queue<String> dataList = new LinkedList<String>();

	
	
	public static FileTranslatorBasis getInstance(String fname){
		if(fname ==null){
			throw new IllegalArgumentException();
		}
		return new FileTranslatorBasis(new File(fname));
	}
	
	private FileTranslatorBasis(File file) {
		this.file = file;
		read();
	}
	
	private void read(){
		try{
			FileReader fr = new FileReader(this.file);
			BufferedReader br = new BufferedReader(fr);
		
			String line;
			while((line = br.readLine())!=null){
				dataList.add(line);
			}
		}catch(IOException e){
			e.printStackTrace();
		}
		numOfCase = Integer.parseInt(dataList.poll());
	}

	public int getNumOfCase(){
		return numOfCase;
	}
	
	public int getIntData(){
		return Integer.parseInt(dataList.poll());
	}
	
	public int[] getIntDataArray(){
		String[] tmp = getStrDataArray();
		int[] data = new int[tmp.length];
		int i = 0;
		for(String t: tmp){
			data[i++] = Integer.parseInt(t);
		}
		return data;
	}
	
	
	public long getLongData(){
		return Long.parseLong(dataList.poll());
	}
	
	public long[] getLongDataArray(){
		String[] tmp = getStrDataArray();
		long[] data = new long[tmp.length];
		int i = 0;
		for(String t: tmp){
			data[i++] = Long.parseLong(t);
		}
		return data;
	}
	public String getStrData(){
		return dataList.poll();
	}
	
	public String[] getStrDataArray(){
		return dataList.poll().split(" ");
	}

	
	
}
