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 com.anuragkapur.jam2012.qr.B;

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.StringTokenizer;

/**
 * @author anuragkapur
 * 
 */
public class DancingWithGooglers {
	
	boolean lifelineAvailable = true;
	int noOfSurprisingTripletsAllowed = -1;
	
	public void writeOutputToFile(String output, String filepath)
			throws IOException {
		FileWriter fstream = new FileWriter(filepath);
		BufferedWriter out = new BufferedWriter(fstream);
		out.write(output);
		out.flush();
		out.close();
	}
	
	// methods for algorithm logic here
	public boolean checkIfTotalScoreMeetsCriteria(int score, int requiredBestScore) {
		
		boolean solution = false;
		int perfectTotal = requiredBestScore * 3;
		
		if (score == 0) {
			if (requiredBestScore == 0) {
				solution = true;
			}else {
				solution = false;
			}
		}else if (perfectTotal == score) {
			// Perfect case. No problems here.
			solution = true;
		}else {
			// First try not to use lifeline
			int difference = perfectTotal - score;
			
			if (difference > 2) {
				// Check if this is doable at all
				if (difference > 4) {
					// No way, this is not doable
					solution = false;
				}else {
					// Can't do without lifeline. Check if lifeline is available
					if (noOfSurprisingTripletsAllowed > 0) {
						// Uselifeline and done.
						noOfSurprisingTripletsAllowed --;
						solution = true;
					}else {
						// No lifeline available
						solution = false;
					}
				}
			}else {
				// Can do without lifeline
				solution = true;
			}
		}
		
		return solution;
	}
	
	public int solveTestCase(String input) {
		
		System.out.println("\n\n\n\nWill solve input string :: " + input);
		
		StringTokenizer tokenizer = new StringTokenizer(input, " ");
		
		int noOfGooglers = -1;
		int bestScore = -1;
		int solution = 0;
		
		int tokenCount = 0;
		while (tokenizer.hasMoreElements()) {
			tokenCount ++;
			
			String token = (String) tokenizer.nextElement();
			if (tokenCount == 1) {
				lifelineAvailable = true;
				noOfGooglers = Integer.parseInt(token);
				System.out.println("no of googlers :: " + noOfGooglers);
			}else if (tokenCount == 2) {
				noOfSurprisingTripletsAllowed = Integer.parseInt(token);
				System.out.println("no of surprising triplets allowed :: " + noOfSurprisingTripletsAllowed);
			}else if (tokenCount == 3) {
				bestScore = Integer.parseInt(token);
				System.out.println("required best score :: " + bestScore);
			}else {
				// This is a googlers score. Check if it meets criteria
				int perfectTotal = bestScore * 3;
				int score = Integer.parseInt(token);
				boolean didMeetCriteria = false;
				
				if (perfectTotal == score) {
					didMeetCriteria = true;
				}else if(perfectTotal > score) {
					didMeetCriteria = checkIfTotalScoreMeetsCriteria(Integer.parseInt(token), bestScore);
				}else if (perfectTotal < score) {
					int difference = score - perfectTotal;
					while(difference > 4) {
						perfectTotal += 3;
						difference = score - perfectTotal;
					}
					didMeetCriteria = checkIfTotalScoreMeetsCriteria(Integer.parseInt(token), bestScore);
				}
				
				System.out.println("check if score meets criteria :: " + score);
				
				if (didMeetCriteria) {
					solution ++;
					System.out.println("Criteria met, solution count :: " + solution);
				}else {
					System.out.println("Didnt meet criteria");
				}
			}
		}
		
		return solution;
	}
	
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		if (args.length < 2) {
			System.out.println("Not enough command line arguments specified. Need 2 (Input and output file paths)");
			return;
		}
		
		String inputFilePath = args[0];
		try {
			// String buffer for storing the output
			StringBuffer output = new StringBuffer();
			
			// Instantiate object to use non static methods
			DancingWithGooglers dance = new DancingWithGooglers();
			
			// read and parse input file
			FileInputStream fstream = new FileInputStream(inputFilePath);
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;

			int lineNumber = 0;
			int noOfTestCases = -1;
			int activeTestCaseNumber = 0;
			while ((strLine = br.readLine()) != null) {
				
				if (lineNumber == 0) {
					noOfTestCases = Integer.parseInt(strLine);
				} else {
					noOfTestCases ++;
					activeTestCaseNumber ++;
					// Now that a test case has been parsed, compute output for
					// this test case
					
					// Invoke algorithm here
					int solutionToTestCase = dance.solveTestCase(strLine);
					
					// Prepare output string
					System.out.println(solutionToTestCase);
					output.append("Case #" + activeTestCaseNumber + ": " + solutionToTestCase);
					output.append("\n");
				}
				lineNumber++;
			}
			
			in.close();
			
			// Pass output string to method to write to file
			dance.writeOutputToFile(output.toString(), args[1]);
			
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			// File read cleanup
		}
	}
}