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 google.codejam;


import java.util.HashMap;

public class GooglereseSolver implements GoogleSolver{
  
  static HashMap<String, String> map = new HashMap<String, String>();
  
  public static void calcualteMapping(){
    String in[] = new String[]{
        "ejp mysljylc kd kxveddknmc re jsicpdrysi", 
        "rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd",
        "de kr kd eoya kw aej tysr re ujdr lkgc jv"};
    
    String out[] = new String[]{
        "our language is impossible to understand",
        "there are twenty six factorial possibilities",
        "so it is okay if you want to just give up"};
    
    int count = 0;
    map.put("y","a");
    map.put("e","o");
    map.put("q","z");
    map.put(" "," ");
    
    for(int i=0 ; i<in.length ; i++){
      for(int j=0 ; j<in[i].length() ; j++){
        String inC = in[i].charAt(j)+"";
        String outC = out[i].charAt(j)+"";
        if(inC.equalsIgnoreCase(" "))continue;
        
        if(map.containsKey(inC)){
          if(!map.get(inC).equalsIgnoreCase(outC+""))
            System.out.println("Different mapping?"+ inC +"->"+map.get(inC) + ", actual:"+outC);
        }else{
          System.out.println("Add mapping:"+ inC +"->"+outC);
          map.put(inC+"", outC+"");
          count++;
        }
      }
    }
    
    
    char missingKey = ' ';
    char missingValue = ' ';
    char check = 'a';
    for(int i=0 ; i<26 ; i++){
      char target = (char)(check+i);
      //System.out.println("check:"+target);
      if(!map.containsKey(target+"")){
        System.out.println("missing Key:"+target);
        missingKey = target;
      }
      
      if(!map.containsValue(target+"")){
        System.out.println("missing Value:"+target);
        missingValue = target;
      }
    }
    map.put(missingKey+"", missingValue+"");
    
    System.out.println("Total mapping:"+ count +"->" + map.size());
  }
    

  @Override
  public String solve(String str) {
    StringBuilder sb = new StringBuilder();
    for(int i=0 ; i<str.length() ; i++){
      sb.append(map.get(str.charAt(i)+""));
    }
    return sb.toString();
  }

}
