import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

package com.qual2;

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.List;

public class qual2 {

	public static void main(String[] args) {
		cNums h = new cNums();
		FileInputStream fis;
		try {
			fis = new FileInputStream("B-large.in");
			FileOutputStream fos = new FileOutputStream("largeBout.txt");
			
			BufferedReader br = new BufferedReader(new InputStreamReader(fis));
			
			int lines = Integer.parseInt(br.readLine());
			String outp = null;
			String inp;
			
			for(int i = 0; i < lines; i++) {
				inp = br.readLine();
				String[] inpar = inp.split(" ");
				
				int lim = Integer.parseInt(inpar[2]);
				int surp = Integer.parseInt(inpar[1]);
				int numbestn = 0;
				int numpossbests = 0;
				for(int a = 3; a < inpar.length; a++) {
					int curr = Integer.parseInt(inpar[a]);
					if(h.bestn[curr] >= lim)
						numbestn++;
					else if(h.bests[curr] >= lim)
						numpossbests++;
				}
				outp = "Case #" + (i+1) + ": ";
				outp += (numbestn + Math.min(surp, numpossbests));
				outp += "\n";
				fos.write(outp.getBytes());
				
			}
			fis.close();
			fos.close();
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}

final class cNums {
	public int[] bestn;
	public int[] bests;
	
	public cNums() {
		bestn = new int[31];
		bests = new int[31];
		FindBests();
	}
	
	private void FindBests() {
		bestn[0] = 0;
		bests[0] = 0;
		for(int i = 1; i < 31; i++) {
			int mod = i % 3;
			bestn[i] = i / 3;
			if(mod == 0)
				bests[i] = bestn[i] + 1;
			else if(mod == 1)
				bests[i] = ++bestn[i];
			else if(mod == 2)
				bests[i] = ++bestn[i] + 1;
		}
	}
}