import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

package codeJam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

/**
 * http://code.google.com/codejam/contest/1460488/dashboard#s=p1
 * @author Weiwei Cheng
 */
public class DancingWithTheGooglers {

    public static void main(String[] args) throws Exception {
        
        BufferedReader br = new BufferedReader(new FileReader("_input.in"));
        BufferedWriter bw = new BufferedWriter(new FileWriter("_output.in"));
        
        br.readLine();
        
        String line = null;
        int count = 0;
        
        while((line=br.readLine())!=null){
           
            String[] input = line.split(" ");

            int numGooglers = Integer.parseInt(input[0]);
            int maxNumSuprises = Integer.parseInt(input[1]);
            int neededScore = Integer.parseInt(input[2]);
            
            int[] scores = new int[numGooglers]; 
            int ans = 0;
            int numSuprises = 0;
            
            for(int i=3; i<input.length; i++){
                scores[i-3] = Integer.parseInt(input[i]);
            }
            
            for(int score : scores){
                if(score % 3 == 0){
                    if(score != 0){
                        int highscoreWithSup = score / 3 + 1;
                        int highscoreNoSup = score / 3;
                        if(highscoreNoSup >= neededScore){
                            ans++;
                        }
                        else if(highscoreWithSup >= neededScore && numSuprises < maxNumSuprises){
                            ans++;
                            numSuprises++;
                        }
                    }
                    else{//score==0
                        if(0 >= neededScore){
                            ans++;
                        }
                    }
                }
                else if(score % 3 == 1){
                    int highscoreWithSup = score / 3 + 1;
                    int highscoreNoSup = highscoreWithSup;
                    if(highscoreNoSup >= neededScore){
                        ans++;
                    }
                }
                else{
                    int highscoreWithSup = score / 3 + 2;
                    int highscoreNoSup = score / 3 + 1;
                    if(highscoreNoSup >= neededScore){
                        ans++;
                    }
                    else if(highscoreWithSup >= neededScore && numSuprises < maxNumSuprises){
                        ans++;
                        numSuprises++;
                    }
                }
            }
                    
            bw.append("Case #" + ++count + ": " + ans);
            
            bw.newLine();
        }

        br.close();
        bw.close();
        
    }

}
