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

package qualification.round.atual;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.Writer;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Googlers {

	/**
	 * @param args
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException {
		File f = new File("B-large-practice.in");
		FileInputStream fis = new FileInputStream(f);
		Scanner scanner = new Scanner(fis);

		File fOut = new File("B-large-practice.out");
		Writer out = new BufferedWriter(new FileWriter(fOut));

		try {
			int t = Integer.parseInt(scanner.nextLine());

			for (int i = 1; i <= t; i++) {
				out.write("Case #" + i + ": "
						+ getNumberOfBestResults(scanner.nextLine()) + "\n");
			}

		} finally {
			scanner.close();
			out.close();
		}

	}

	private static int getNumberOfBestResults(String line) {
		int number = 0;
		String elements[] = line.split(" ");
		int n = Integer.parseInt(elements[0]);
		int s = Integer.parseInt(elements[1]);
		int p = Integer.parseInt(elements[2]);

		int i = 1;
		while (i <= n) {
			int total = Integer.parseInt(elements[i + 2]);
			i++;
			List<String> bests = getBestsGreaterThanP(p, total);
			for (String best : bests) {
				String[] values = best.split(" ");
				int v1 = Integer.parseInt(values[0]);
				int v2 = Integer.parseInt(values[1]);
				int v3 = Integer.parseInt(values[2]);

				if (v1 - v2 <= 1 && v2 - v1 <= 1 && v2 - v3 <= 1
						&& v3 - v2 <= 1 && v1 - v3 <= 1 && v3 - v1 <= 1) {
					number++;
					break;
				} else if (s > 0) {
					s--;
					number++;
					break;
				}
			}
		}

		return number;
	}

	private static List<String> getBestsGreaterThanP(int p, int total) {
		List<String> list = new ArrayList<String>();

		if (total % 3 == 0) {
			int c = total / 3;
			if (c >= p) {
				list.add(c + " " + c + " " + c);
			} else if (c + 1 >= p && c - 1 >= 0 && c + 1 <= 10) {
				list.add((c - 1) + " " + c + " " + (c + 1));
			}
		} else {
			int c = (int) Math.floor(total / 3);

			if (total % 3 == 1) {
				if (c + 1 >= p && c + 1 <= 10) {
					list.add(c + " " + c + " " + (c + 1));
				}
				if (c + 1 >= p && c - 2 >= 0 && c + 1 <= 10) {
					list.add((c - 2) + " " + (c + 1) + " " + (c + 1));
				}
			} else {
				if (c + 1 >= p && c + 1 <= 10) {
					list.add((c + 1) + " " + c + " " + (c + 1));
				}
				if (c + 2 >= p && c + 2 <= 10) {
					list.add(c + " " + c + " " + (c + 2));
				}
			}
		}

		return list;
	}
}