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 qualification;

import java.io.*;

public class Bsmall {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("./src/qualification/B-large.in"));
		BufferedWriter bw = new BufferedWriter(new FileWriter("./src/qualification/B-large.out"));
		int[][] inputs = new int[100][103];
		int casenumber = 0;
		String input = null;
		int total = 0;
		while((input=br.readLine()) != null)
		{
			if(casenumber==0)
			{
				total = Integer.parseInt(input);
			}else{
				String[] array = input.split(" ");
				// N
				inputs[casenumber-1][0] = Integer.parseInt(array[0]);
				// S
				inputs[casenumber-1][1] = Integer.parseInt(array[1]);
				// p
				inputs[casenumber-1][2] = Integer.parseInt(array[2]);
				// N integers ti.
				for(int i=3;i<array.length;i++)
				{
					inputs[casenumber-1][i] = Integer.parseInt(array[i]);
				}
			}
			casenumber++;
		}
		casenumber=1;
		while(casenumber <= total)
		{
			//System.out.println("Case #" + casenumber + ": " + String.valueOf(surprisingTriplets(inputs[casenumber-1], bw)));
			bw.write("Case #" + casenumber + ": " + String.valueOf(surprisingTriplets(inputs[casenumber-1], bw)));
			bw.newLine();
			casenumber++;
		}
		bw.close();
	}
	
	public static int surprisingTriplets(int[] inputs, BufferedWriter bw) throws IOException
	{
		int n = inputs[0];
		int s = inputs[1];
		int p = inputs[2];
		
		int sum=0;
		int count=0;
		int used=0;
		int i = 0;
		while(i<n)
		{
			sum=inputs[i+3];
			if(sum==0 && p==0){
				count++;
			}else if(sum!=0){
				int[] triplets = new int[3];
				triplets[0]=sum/3;
				triplets[1]=sum/3;
				triplets[2]=sum/3;
				if(triplets[0]>=p)
				{
					count++;
				}else if(sum%3==2)
				{
					if(triplets[0]==(p-2) && (s-used>0))
					{
						triplets[0]+=2;
						used++;
						count++;
					}else{
						triplets[0]++;
						triplets[1]++;
						if(triplets[0]>=p)
						{
							count++;
						}
						
					}
				}else if(sum%3==1)
				{
					triplets[0]++;
					if(triplets[0]>=p)
					{
						count++;
					}
				}else if(sum%3==0)
				{
					if(s-used>0 && triplets[0]==p-1)
					{
						triplets[0]++;
						triplets[2]--;
						used++;
						count++;
					}
				}
			}
			i++;
		}
		return count;
	}
}
