import java.io.*;
import java.util.*;

public class DancingWithGooglers {

  public static class Googlers {

    public int T;
    public int surp;
    public boolean surprising;
    public boolean pSurprising;
    public boolean antiSurprising;
    public boolean pAntiSurprising;

    public Googlers(int T, int surp) {
      this.T = T;
      this.surp = surp;
    }

    public void set(int a, int b, int c) {
      if (c >= 0 && (a + b + c) == T) {
        int diff = (Math.max(a, Math.max(b, c)) - Math.min(a, Math.min(b, c)));
        if (diff <= 2) {
          if (diff == 2) {
            if (a >= surp || b >= surp || c >= surp) {
              pSurprising = true;
            } else {
              surprising = true;
            }
          } else {
            if (a >= surp || b >= surp || c >= surp) {
              pAntiSurprising = true;
            } else {
              antiSurprising = true;
            }
          }
        }
      }
    }
  }

  public static void main(String... args) throws IOException {
//    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    BufferedReader reader = new BufferedReader(new FileReader("B-large.in"));
//    PrintWriter writer = new PrintWriter(System.out);
    PrintWriter writer = new PrintWriter("B-large.out");

    int len, cases = Integer.parseInt(reader.readLine());
    List<Googlers> satisfied = new ArrayList<Googlers>();
    List<Googlers> unsatisfied = new ArrayList<Googlers>();
    String[] inputs;
    int N, S, p;
    for (int i = 1; i <= cases; i++) {
      inputs = reader.readLine().split(" ");
      p = Integer.parseInt(inputs[1]);
      S = Integer.parseInt(inputs[2]);
      satisfied.clear();
      unsatisfied.clear();
      for (int j = 3; j < inputs.length; j++) {
        int t = Integer.parseInt(inputs[j]);
        Googlers googlers = new Googlers(t, S);

        for (int k = 0; k <= 10; k++) {
          int till = k + 2 > 10 ? 10 : k + 2;
          for (int l = k; l <= till; l++) {
            googlers.set(k, l, (t - (k + l)));
          }
        }
        if (googlers.pAntiSurprising) {
          satisfied.add(googlers);
        } else {
          unsatisfied.add(googlers);
        }
      }
      int pSurprising = 0;
      if (p > 0) {
        for (Iterator<Googlers> iter = unsatisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.pSurprising) {
            pSurprising++;
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = unsatisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.surprising) {
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = satisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.pSurprising) {
            iter.remove();
            pSurprising++;
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = satisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.surprising) {
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }

      if(p > 0){
        writer.print("Case #" + i + ": 0");
      }else {
        writer.print("Case #" + i + ": " + (satisfied.size() + pSurprising));
      }
      writer.println();
    }
    writer.flush();
  }


}

package com.google.codejam;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class DancingGooglers {
	public static void main(String[] args) throws FileNotFoundException {
		new DancingGooglers().run();
	}
	
	private static class Data {
		@Override
		public String toString() {
			return "Data [googlers=" + googlers + ", surprisingTriplets="
					+ surprisingTriplets + ", p=" + p + ", totals="
					+ Arrays.toString(totals) + "]";
		}
		public int googlers;
		public int surprisingTriplets;
		public int p;
		public Integer[] totals;
		
	}

	private void run() throws FileNotFoundException {
		Data[] data = parseInput("input");
		Integer[] result = solve(data);
		printResult(result, "output");
	}
	
	private Integer[] solve(Data[] data) {
		Integer[] result = new Integer[data.length];
		for (int i = 0; i < data.length; i++) {
			result[i] = solve(data[i]);
//			System.out.println("Max number of Googlers with p: " + result[i]);
		}
		return result;
	}

	private Integer solve(Data data) {
//		System.out.println(data);
		
		int counter = 0;
		int availableSurpises = data.surprisingTriplets;
		
		for (Integer total : data.totals) {
			if (data.p == 0) {
//				System.out.println("Googler with total=" + total + " has scored minimum of " + data.p);
				counter++;
			} else  
			if (total >= Math.max(1, data.p*3 - 2)) {
//				System.out.println("Googler with total=" + total + " has scored minimum of " + data.p);
				counter++;
			} else if (availableSurpises > 0 && total >= Math.max(1, data.p*3 - 4)){
//				System.out.println("Googler with total=" + total + " might scored minimum of " + data.p + " with suprising score");
				counter++; availableSurpises--;
			} else {
//				System.out.println("Googler with total=" + total + " couldn't score minimum of " + data.p);
			}
		}
		
		return counter;
	}

	private void printResult(Integer[] result, String path) throws FileNotFoundException {
		PrintWriter p = new PrintWriter(new File(path));
		try { 
			for (int i = 1; i < result.length+1; i++) {
				p.format("Case #%d: %d\n", i, result[i-1]);
			}
		} finally {
			p.close();
		}
	}

	private Data[] parseInput(String path) throws FileNotFoundException {
		Scanner scanner = new Scanner(new File(path));
		try {
			Data[] input = new Data[scanner.nextInt()];
			for (int i = 0; i < input.length; i++) {
				scanner.nextLine(); // skip to the next line
				Data data = new Data();
				data.googlers = scanner.nextInt();
				data.surprisingTriplets = scanner.nextInt();
				data.p = scanner.nextInt();

				data.totals = new Integer[data.googlers];
				for (int g = 0; g < data.googlers; g++) {
					data.totals[g] = scanner.nextInt();
				}
				input[i] = data;
			}
			return input;
		} finally {
			scanner.close();
		}
	}
}
