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.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import static java.lang.Math.abs;

public class B {

	public static void main(String[] args) throws IOException {
		Scanner in = new Scanner(new FileReader("input.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("output"));

		int T = in.nextInt();

		int n, s, p;
		for (int i = 1; i <= T; i++) {
			// read input
			n = in.nextInt(); s = in.nextInt();	p = in.nextInt();
			int[] googlers = new int[n];
			for (int j = 0; j < n; j++)
				googlers[j] = in.nextInt();

			// solve
			int ans = solve(n, s, p, googlers);
			bw.write("Case #" + i + ": " + ans);
			bw.newLine();
		}
		
		bw.close();
		System.out.println("end");
	}

	private static int solve(int n, int s, int p, int[] googlers) throws IOException {
		boolean[] surp = new boolean[n];
		boolean[] reach = new boolean[n];
		boolean[] both = new boolean[n];
		
		for (int T = 0; T < n; T++)
			for (int i = 0; i <= 10; i++)
				for (int j = i; j <= i+2 && j <= 10; j++)
					for (int k = j; k <= j+2 && j <= 10; k++)
						if (i+j+k == googlers[T] && check(i, j, k))
						{
							boolean a = isSurprising(i, j, k), b = reached(i, j, k, p);
							if(!surp[T]) surp[T] = a && !b;
							if(!reach[T]) reach[T] = b && !a;
							if(!both[T]) both[T] = a && b; 
						}
		
		int max = findMax(n, s, p, surp, reach, both);
		
		return max;
	}

	private static int findMax(int n, int s, int p, boolean[] surp,	boolean[] reach, boolean[] both) {
		
		int max = 0;
		for(int i = 0; i < n; i++)
			if(both[i] || reach[i])max++;
		
		int ss = 0;
		for(int i = 0; i < n; i++)
			if(surp[i] || both[i]) ss++;
		
		if(ss == s)
			return max;
		else // ss > s
		{
			for(int i = 0; i < n; i++)
				if(surp[i] || (both[i] && reach[i])) ss--;
			
			if(ss <= s)
				return max;
			else
				return max-(ss-s);
			
		}
	}

	private static boolean reached(int i, int j, int k, int p) {
		return Math.max(i, Math.max(j, k)) >= p;
	}

	private static boolean isSurprising(int i, int j, int k) {
		return abs(i - j) == 2 || abs(j - k) == 2 || abs(i - k) == 2;
	}

	private static boolean check(int i, int j, int k) {
		return abs(i - j) <= 2 && abs(j - k) <= 2 && abs(i - k) <= 2;
	}
}
