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 quiz2012.quiz2;

import java.util.ArrayList;
import java.util.List;

import domain.QuizSolver;
import domain.QuizTestCaseInput;
import domain.QuizTestCaseOutput;

public class Quiz2Solver implements QuizSolver {
	private static final int NUMBER_OF_JUDGES = 3;

	@Override
	public QuizTestCaseOutput solve(QuizTestCaseInput testCaseInput) {
		Quiz2TestCaseInput input = (Quiz2TestCaseInput) testCaseInput;
		System.out.println(input);
		int numberOfGooglers = input.getNumberOfGooglers();
		int numberOfSurprising = input.getNumberOfSurprising();
		int minBestResult = input.getMinBestResult();
		int[] totalPoints = input.getTotalPoints();
		List<Googler> surprisePossibleGooglers = new ArrayList<Googler>();
		int numberOfGooglersHavingMinBestResultWithoutSurprising = 0;
		for (int i = 0; i < numberOfGooglers; i++) {
			int q = totalPoints[i] / NUMBER_OF_JUDGES;
			int r = totalPoints[i] % NUMBER_OF_JUDGES;
			Googler googler = new Googler(q, r);
			if (googler.getBestResult() >= minBestResult) {
				numberOfGooglersHavingMinBestResultWithoutSurprising++;
			} else {
				if (totalPoints[i] >= 2 && totalPoints[i] <= 28) {
					googler.setSurprising(true);
					surprisePossibleGooglers.add(googler);
				}
			}
		}

		int numberOfPossibleGooglersHavingMinBestResultWithSurprise = 0;
		for (Googler googler : surprisePossibleGooglers) {
			if (googler.getBestResult() >= minBestResult) {
				numberOfPossibleGooglersHavingMinBestResultWithSurprise++;
			}
		}

		int numberOfGooglersHavingMinBestResultWithSurprise = Math.min(
				numberOfSurprising,
				numberOfPossibleGooglersHavingMinBestResultWithSurprise);

		int numberOfGooglersHavingMinBestResult = numberOfGooglersHavingMinBestResultWithoutSurprising
				+ numberOfGooglersHavingMinBestResultWithSurprise;

		System.out.println(numberOfSurprising + ", "
				+ numberOfPossibleGooglersHavingMinBestResultWithSurprise
				+ ", " + numberOfGooglersHavingMinBestResultWithSurprise + ", "
				+ numberOfGooglersHavingMinBestResultWithoutSurprising + ", "
				+ numberOfGooglersHavingMinBestResult);
		return new Quiz2TestCaseOutput(numberOfGooglersHavingMinBestResult);
	}
}

class Googler {
	private final int q;
	private final int r;
	private boolean surprising;

	public Googler(int q, int r) {
		this.q = q;
		this.r = r;
	}

	public void setSurprising(boolean surprising) {
		this.surprising = surprising;
	}

	public Integer getBestResult() {
		switch (r) {
		case 0:
			return q + (surprising ? 1 : 0);

		case 1:
			return q + 1;

		case 2:
			return q + 1 + (surprising ? 1 : 0);
		}
		throw new IllegalStateException("r must be 0, 1, or 2: " + r);
	}

	@Override
	public String toString() {
		return "Googler [q=" + q + ", r=" + r + ", surprising=" + surprising
				+ "]";
	}
}