import java.util.Scanner;
public class B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int zz = 1; zz <= T;zz++){
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int x = 0;
			for(int i = 0; i < N;i++){
				int score = in.nextInt();
				int best = score/3;
				int mod = score%3;
				int diff = p-best;
				if(diff<1){
					x++;
				}else if(diff<2){
					if(mod==0 && score !=0){
						if(S!=0){
							S--;x++;
						}
					}else if(score!=0){
						x++;
					}
				}else if(diff<3){
					if(mod==2){
						if(S!=0){
							S--;x++;
						}
					}
				}
			}
			System.out.format("Case #%d: %d\n", zz, x);
		}
	}
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Scanner;
public class DancingWiththeGooglers {

public static void main(String[] args) throws Exception {
    PrintWriter out = new PrintWriter("output2.out");
    Scanner in = new Scanner(new File("B-large.in"));
    int testCases = in.nextInt();
     for (int i = 1; i <= testCases; i++){
        int N = in.nextInt(),counter=0;
         int S = in.nextInt();
         int P = in.nextInt();
         for(int j = 0 ; j < N ;j++){ 
             int googler= in.nextInt();
                 if(googler%3 == 0 && googler!=0){
                     if(googler/3 >= P){
                         counter++;
                                      }
                  else if(googler/3 + 1 >= P && S!=0){
                              counter++;
                               S--;
                                       }
                             }
           else if (googler==0 && P==0){
            counter++;
                          }
           else if(googler%3==1){
         if(googler/3 + 1 >= P){
          counter++;
}
}
else if(googler%3==2){
if(googler/3 + 1 >= P){
counter++;
}
else if(googler/3 + 2 >= P && S!=0){
counter++;
S--;
}
}
}
out.printf("Case #%d: %d",i,counter);
out.printf("\n");
}
out.close();
in.close();

}

}