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


    }
}


import java.util.Scanner;

public class BDancingWithGooglers {
    public static void main(String[] ags)   {
      //System.setIn(new FileInputStream("src/com/afarok/google/codejam2012/qualificationround/B-small-attempt1.in"));
      //System.setOut(new PrintStream(new File("src/com/afarok/google/codejam2012/qualificationround/B-small-attempt1.out")));
        Scanner stdIn = new Scanner(System.in);
        int t = stdIn.nextInt();
        for(int tCase=1;tCase<=t;++tCase) {
            int n = stdIn.nextInt();
            int ns = stdIn.nextInt();
            int p = stdIn.nextInt();
            
            int y =0;
            for(int i=0;i<n;++i) {
                int nextTotal = stdIn.nextInt();
                int d = nextTotal/3;
                int r = nextTotal%3;
                
                if(nextTotal<p) continue;
                
                if(d>=p) {
                    ++ y;
                    continue;
                }
                
                if(p-d>2) continue;
                
                if(p-d==1) {
                    if(r>0) {
                        ++y;
                        continue;
                    } else {
                        if(ns>0) {
                            ++y;
                            --ns;
                            continue;
                        }
                    }
                } else {
                    if(ns>0 && r==2) {
                        ++y;
                        --ns;
                        continue;
                    }
                }
                
                
            }
            System.out.println("Case #"+tCase+": "+y);
        }
    }
}
