package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

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