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

import java.io.IOException;
import java.util.List;

public class Dancing extends JamProblem {

    public static void main(String[] args) throws IOException {
        Dancing p = new Dancing();
        p.go();
    }

    @Override
    String solveCase(JamCase jamCase) {
        int res = 0;
        DancingCase ca = (DancingCase) jamCase;
        for (int i = 0; i < ca.sums.length; i++) {
            int sum = ca.sums[i];
            if (sum == 0) {
                if (ca.p == 0) {
                    res++;
                }
                continue;
            }
            int n = sum % 3;
            int one = sum / 3;
            if (n == 0) {
                if (one >= ca.p) {
                    res++;
                    continue;
                }
                if (ca.sup > 0) {
                    if (one + 1 >= ca.p) {
                        res++;
                        ca.sup--;
                    }
                }
            }

            if (n == 1) {

                if (one + 1 >= ca.p) {
                    res++;
                }
            }
            if (n == 2) {
                if (one + 1 >= ca.p) {
                    res++;
                    continue;
                }

                if (ca.sup > 0) {
                    if (one + 2 >= ca.p) {
                        res++;
                        ca.sup--;
                    }
                }
            }
        }
        return "" + res;
    }

    @Override
    JamCase parseCase(List<String> file, int line) {
        DancingCase ca = new DancingCase();
        ca.lineCount = 1;
        String s = file.get(line);
        List<Integer> integers = JamUtil.parseIntList(s);
        int gs = integers.get(0);
        ca.sup = integers.get(1);
        ca.p = integers.get(2);
        ca.sums = new int[gs];
        for (int i = 0; i < gs; i++) {
            ca.sums[i] = integers.get(3 + i);
        }

        return ca;
    }
}

class DancingCase extends JamCase {
    int p;
    int[] sums;
    int sup;
}