package problem1;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Arrays;





public class Problem1 {

    public static void main(String[] args) throws FileNotFoundException, IOException{
        try {
             TextIO.readFile("L:\\Coodejam\\Input\\Input.txt");
        }
        catch (IllegalArgumentException e) {
              System.out.println("Can't open file ");
              System.exit(0);
         }
        
        FileOutputStream fout = new FileOutputStream("L:\\Coodejam\\Output\\output.txt");
        PrintStream ps=new PrintStream(fout);
        
        int cases=TextIO.getInt();
        int googlers=0,surprising=0,least=0;
        for(int i=0;i<cases;i++){
            int counter=0;
            googlers=TextIO.getInt();
            surprising=TextIO.getInt();
            least=TextIO.getInt();
            int score[]=new int[googlers];
            for(int j=0;j<googlers;j++){
                score[j]=TextIO.getInt();
                 }
            
            
            
            
            Arrays.sort(score);
            int temp=0;
            int sup[]=new int[surprising];
            
          for(int j=0;j<googlers && surprising>0;j++){
               if(biggestNS(score[j])<least && biggestS(score[j])==least){
                   surprising--;
                   counter++;
                }
               }
           
            for(int j=0;j<googlers;j++){
                if(surprising==0)temp=biggestNS(score[j]);
                    
                else {
                    temp=biggestS(score[j]);
                    surprising--;     
                } 
                   if(temp>=least)counter++;
           
             }
            
             ps.println("Case #"+(i+1)+": "+counter);
        }
    }
    
   static int biggestNS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-1)/3)+1;
   }
   
   static int biggestS(int x){
       if(x==0)return 0;
       if(x==1)return 1;
       return ((x-2)/3)+2;
   }
}

import java.util.Scanner;
import java.io.*;
import java.util.LinkedList;

/**
 * A program to simulate a Snapper
 *
 *
 * @see Google CodeJam
 *
 * @since 8 may 2010
 * @version 1.0
 * @author ididi, Jeroen van Oorschot
 */
public class Dancers {

    Scanner sc;
    String fileName = "B-small-attempt0";
    File file = new File(fileName + ".in");
    FileWriter out;
    PrintWriter output;
    /* the snapper checker
     * 
     * @pre true
     * @post true
     */

    public void snapper() {
        try {
            sc = new Scanner(file);
        } catch (FileNotFoundException e) {
            System.out.println("no input file found");
            System.out.println(fileName + ".in");
        }
        try {
            out = new FileWriter(fileName + ".out");
        } catch (IOException e) {
            System.out.println(e.getMessage());
        }
        output = new PrintWriter(out);
        int tries = sc.nextInt();
        sc.nextLine();
        for (int i = 1; i <= tries; i++) {
            output.print("Case #" + i + ": ");
            run();
            output.println();
        }
        try {
            out.close();
        } catch (IOException e) {
            System.out.println(e.getMessage());
        }


    }

    public void run() {
        int n = sc.nextInt();
        int s = sc.nextInt();
        final int p = sc.nextInt();
        int ans = 0;
        for (int i = 0; i < n; i++) {
            int t = sc.nextInt();
            if (t / 3 >= p) {
                ans++;
            } else if (t / 3 == p - 2 && t % 3 == 2 && s > 0) {
                ans++;
                s--;
            } else if (t / 3 == p - 1) {
                if (t % 3 == 2 || t % 3 == 1) {
                    ans++;
                } else if (s > 0 && t > 0) {
                    ans++;
                    s--;
                }
            }
        }
        output.print(ans);
    }

    public static void main(String[] args) {
        new Dancers().snapper();
    }
}
