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();
  }


}

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.lang.reflect.Array;

public class GCJ2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		GCJ2 g = new GCJ2();

//		int i1 = g.calculate(3, 1, 3, 6, 6, 3);
//		System.out.println(i1);
		
//		int i1 = g.calculate(3, 1, 5, 15, 13, 11);
//		int i2 = g.calculate(3, 0, 8, 23, 22, 21);
//		int i3 = g.calculate(2, 1, 1, 8, 0);
//		int i4 = g.calculate(6, 2, 8, 29, 20, 8, 18, 18, 21);
//
//		System.out.println(i1);
//		System.out.println(i2);
//		System.out.println(i3);
//		System.out.println(i4);

		try {
			// Open the file that is the first
			// command line parameter
			FileInputStream fstream = new FileInputStream(
					"C:/PROG/java/work/tc/src/gcj2.txt");
			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			// Read File Line By Line
			int lineNum = 1;
			br.readLine();

			while ((strLine = br.readLine()) != null) {
				// Print the content on the console
				

//				System.out.print(strLine+"\t");
				String[] val = strLine.split("\\s");
				int[] valI = new int[val.length-3];
				for (int i = 3; i < val.length; i++) {

					valI[i-3] = Integer.valueOf(val[i]);

					// System.out.print(val[i]+"_"+valI[i]);

				}
				System.out.print("Case #" + lineNum + ": ");
				System.out
						.println(g.calculate(Integer.valueOf(val[0]),
								Integer.valueOf(val[1]),
								Integer.valueOf(val[2]), valI));
//				 System.out.println();

				// System.out.println(strLine.charAt(0));
				lineNum++;
			}
			// Close the input stream
			in.close();
		} catch (Exception e) {// Catch exception if any
			e.printStackTrace();
		}
	}

	public int calculate(int n, int surprises, int p, int... tArray) {

		int counterGreaterThanP = 0;
		int surpriseRemaining = surprises;

		for (int t : tArray) {

			int d = t / 3;
			int r = t % 3;
			int max = 0;
			int maxS = 0;

			if (t == 0) {
				max = 0;
				maxS = 0;
			} else if (t == 30) {
				max = 10;
				maxS = 10;
			} else if (t == 1) {
				max = 1;
				maxS = 1;
			} else if (t == 2) {
				max = 1;
				maxS = 2;
			} else {

				if (r == 0) {
					max = d;
					maxS = d + 1;
				} else if (r == 1) {
					max = d + 1;
					maxS = d + 1;
				} else if (r == 2) {
					max = d + 1;
					maxS = d + 2;
				}

			}
			if (max >= p) {
				counterGreaterThanP++;
			} else if (maxS >= p && surpriseRemaining > 0) {
				counterGreaterThanP++;
				surpriseRemaining--;
			}
		}

		return counterGreaterThanP;
	}

}
