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.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintStream;
import java.util.StringTokenizer;

public class B {

    private B() {
    }

    public static void main(final String[] args) throws Exception {
        final B a = new B();
        a.solve();
    }

    public void solve() throws Exception {
        final BufferedReader in = new BufferedReader(new FileReader(new File("f.in")));
        System.setOut(new PrintStream(this.getClass().getSimpleName() + ".out"));
        // StringTokenizer st;
        final String line = in.readLine();
        final int test = Integer.parseInt(line);
        for (int q=1; q <= test;q++) {
            final StringTokenizer st = new StringTokenizer(in.readLine());

            final int N = Integer.parseInt(st.nextToken());
            final int S = Integer.parseInt(st.nextToken());
            final int p = Integer.parseInt(st.nextToken());
            final int[] mas = new int[N];
            for (int i = 0; i < N; i++) {
                mas[i] = Integer.parseInt(st.nextToken());
            }

            final int[][] result = new int[N][3];
            for (int i = 0; i < N; i++) {
                result[i][0] = (mas[i] + 2) / 3; // Normal
                if (mas[i] == 0) {
                    result[i][1] = 0;
                    continue;
                }
                final int div = mas[i] / 3;
                final int mod = mas[i] % 3;
                if (mod == 0) {
                    result[i][1] = div + 1; // Suprised
                } else if (mod == 1) {
                    result[i][1] = -1; // Suprised
                } else if (mod == 2) {
                    result[i][1] = div + 2; // Suprised
                }
                // result[i][0] = (mas[i]+2)/3; //bonus
            }

            int res = 0;
            int added = 0;

            for (int i = 0; i < N; i++) {
                if (result[i][0] >= p) {
                    res++;
                    continue;
                }
                if (result[i][1] >= p) {
                    added++;
                    continue;
                }
            }

            res = res + Math.min(added, S);
            System.out.println("Case #" + q + ": " + res);
        }
    }
}
