/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

package codejam;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class ProblemB {
	
	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception{
		// TODO Auto-generated method stub

		Scanner sc = new Scanner(new File("ProblemB.txt.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter(new File("ProblemB.txt.out")));
		
		int t = sc.nextInt();
		
		for(int i=0;i<t;i++){
			
			int n = sc.nextInt();
			int s= sc.nextInt();
			int p = sc.nextInt();
			
			int count =0;
			
			for(int j=0;j<n;j++){
				int x = sc.nextInt();
				int max, diff=0;
				
				if(x%3==0)max = x / 3;
				else max = x/3 + 1;
				
				if(x%3==1) diff=-1;
				
				if (max >=p) count++;
				else if ((max+1) == p && s>0 && diff!=-1 && max>0){
					s--;
					count++;
				}
					
			}
				
			bw.write("Case #" + (i+1) +": "+ count +"\n");
			System.out.println("Case #" + (i+1) +": "+ count);
			}
		
			bw.close();
			sc.close();
				
			
		}
		
	}


