package com.example;

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

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}


import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.logging.Level;
import java.util.logging.Logger;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author aliakbars
 */
public class Googlers {

    public static void main(String[] args) {
        Googlers gr = new Googlers();
        FileInputStream fstream = null;
        FileWriter fwrite;
        int jml;
        int s;
        int p;
        int okay;
        try {
            fstream = new FileInputStream("B-large.in");
            fwrite = new FileWriter("B-large.out");
            BufferedWriter ofile = new BufferedWriter(fwrite);
            DataInputStream ifile = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(ifile));
            String num = br.readLine();
            for (int i = 0; i < Integer.parseInt(num); i++) {
                String[] input = br.readLine().split(" ");
                jml = Integer.parseInt(input[0]);
                s = Integer.parseInt(input[1]);
                p = Integer.parseInt(input[2]);
                okay = 0;
                for (int j = 0; j < jml; j++) {
                    int x = Integer.parseInt(input[3+j]);
                    if (x / 3 >= p) {
                        okay++;
                    } else {
                        if (x / 3 + 1 >= p && x != 0) {
                            if (x - (x / 3) * 3 + (x / 3) >= p) {
                                okay++;
                            } else {
                                if (s > 0) {
                                    okay++;
                                    s--;
                                }
                            }
                        } else if (x / 3 + 2 >= p && x != 0) {
                            if ((x / 3) * 3 + 2 == x) {
                                if (s > 0) {
                                    okay++;
                                    s--;
                                }
                            }
                        }
                    }
                }
                try {
                    ofile.write("Case #" + (i + 1) + ": " + okay);
                    ofile.newLine();
                } catch (Exception e) {
                    System.err.println("Error: " + e.getMessage());
                }
                System.out.println("Case #" + (i + 1) + ": " + okay);
            }
            ofile.close();
        } catch (IOException ex) {
            Logger.getLogger(Googlerese.class.getName()).log(Level.SEVERE, null, ex);
        } finally {
            try {
                fstream.close();
            } catch (IOException ex) {
                Logger.getLogger(Tutorial.class.getName()).log(Level.SEVERE, null, ex);
            }
        }
    }
}
