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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;

public class SolutionB_2 {

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

	String curDir = "DancingWithGooglers/";

	Scanner sc = new Scanner(new FileReader(curDir + "B-large.in"));
	PrintWriter pw = new PrintWriter(new FileWriter(curDir + "B-large.out"));

	int totalTestCase = Integer.parseInt(sc.nextLine());

	for (int testCase = 1; testCase <= totalTestCase; testCase++) {
	    Integer nGoogler = sc.nextInt();
	    Integer nSurprising = sc.nextInt();
	    Integer bestNum = sc.nextInt();

	    Integer maxNum = 0;
	    Integer nCheck = 0;

	    List<Integer> g = new ArrayList<Integer>();
	    List<Integer> g1 = new ArrayList<Integer>();

	    for (int i = 0; i < nGoogler; i++) {
		Integer a = sc.nextInt();
		g.add(a);
		g1.add(a);
	    }

	    if (nSurprising == 0) {
		for (Integer t : g) {
		    int y = t / 3;
		    int z = t % 3;

		    if (t == 0 || t == 1) {
			if (t >= bestNum) {
			    maxNum++;
			}
		    } else if (z == 0) {
			if (y >= bestNum) {
			    maxNum++;
			}
		    } else if (z == 1) {
			if (y + 1 >= bestNum) {
			    maxNum++;
			}
		    } else if (z == 2) {
			if (y + 1 >= bestNum) {
			    maxNum++;
			}
		    }
		}
	    } else {
		java.util.Collections.sort(g, new Comparator<Integer>() {
		    public int compare(Integer a, Integer b) {
			if (a > b) {
			    return 1;
			} else if (a < b) {
			    return -1;

			} else {
			    return 0;
			}
		    }
		});

		for (Iterator<Integer> it = g.iterator(); it.hasNext();) {
		    Integer t = it.next();

		    int y = t / 3;
		    int z = t % 3;

		    if (t == 0 || t == 1) {
			continue;
		    } else if (z == 0) {
			if (y + 1 >= bestNum && nCheck < nSurprising) {
			    maxNum++;
			    nCheck++;
			    it.remove();
			}
		    } else if (z == 1) {
			if (y + 1 >= bestNum && nCheck < nSurprising) {
			    maxNum++;
			    nCheck++;
			    it.remove();
			}
		    } else if (z == 2) {
			if (y + 2 >= bestNum && nCheck < nSurprising) {
			    maxNum++;
			    nCheck++;
			    it.remove();
			} else if (y + 1 >= bestNum && nCheck < nSurprising) {
			    maxNum++;
			    nCheck++;
			    it.remove();
			}
		    }
		}

		if (nCheck >= nSurprising) {
		    for (Integer t : g) {
			int y = t / 3;
			int z = t % 3;

			if (t == 0 || t == 1) {
			    if (t >= bestNum) {
				maxNum++;
			    }
			} else if (z == 0) {
			    if (y >= bestNum) {
				maxNum++;
			    }
			} else if (z == 1) {
			    if (y + 1 >= bestNum) {
				maxNum++;
			    }
			} else if (z == 2) {
			    if (y + 1 >= bestNum) {
				maxNum++;
			    }
			}
		    }
		}

	    }

	    pw.println(String.format("Case #%d: %d", testCase, maxNum));
	    System.out.println(String.format("Case #%d: %d, %d, %s => %d", testCase, nSurprising, bestNum, g1.toString(), maxNum));
	}

	pw.flush();
	pw.close();
	sc.close();
    }
}
