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.*;
import java.util.Arrays;

public class Main{
	
	public static void main(String[] args) throws Exception {
		int t = Integer.parseInt(finB.readLine());
		int test = 1;
		while(test <= t){
			int n = fnextInt();
			int s = fnextInt();
			int p = fnextInt();
			int[] a = new int[n];
			for(int i = 0; i < n; i++){
				a[i] = fnextInt();
			}
			print(n + " " + s + " " + p + " ");
			for(int i = 0; i < n; i++){
				print(a[i] + " ");
			}
			int[] max = new int[n];
			for(int i = 0; i < n; i++){
				if(a[i] / 3 == 0){
					if(p == 2 && a[i] == 2 && s > 0){
						max[i] = a[i];
						s--;
						continue;
					}
					else if(a[i] == 2) max[i] = 1;
					else max[i] = a[i];
					continue;
				}
				if(a[i] % 3 == 0 && a[i] / 3 < p){
					if(s > 0 && a[i] / 3 + 1 == p){
						max[i] = a[i] / 3 + 1;
						s--;
						continue;
					}
				}
				if(a[i] % 3 == 2 && a[i] / 3 + 1 < p){
					if(s > 0 && a[i] / 3 + 2 == p){
						max[i] = a[i] / 3 + 2;
						s--;
						continue;
					}
				}
				max[i] = a[i] % 3 > 0 ? a[i] / 3 + 1 : a[i] / 3;
			}
			int ans = 0;
			for(int i = 0; i < n; i++){
				if(max[i] >= p) ans++;
			}
			fout.println("Case #" + test + ": " + ans);
			println("Case #" + test + ": " + ans);
			test++;
		}
		fout.flush();
	}
		
	private static PrintWriter out;
	private static BufferedReader inB;
	private static BufferedReader finB;
	private static PrintWriter fout;
	
	
	static {
		try {
			finB = new BufferedReader(new InputStreamReader(new FileInputStream("input.in")));
			fout = new PrintWriter(new FileOutputStream("output.txt"));
			out = new PrintWriter(System.out);
			inB = new BufferedReader(new InputStreamReader(System.in));
		} catch(Exception e) {e.printStackTrace();}
	}
	
	private static StreamTokenizer in = new StreamTokenizer(inB);
	private static StreamTokenizer fin = new StreamTokenizer(finB);
	
	private static void exit(Object o) throws Exception {
		out.println(o);
		out.flush();
		System.exit(0);
	}
	private static void println(Object o) throws Exception{
		out.println(o);
		out.flush();
	}
	private static void print(Object o) throws Exception{
		out.print(o);
		out.flush();
	}
	private static int fnextInt() throws Exception {
		fin.nextToken();
		return (int)fin.nval;
	}  
	private static int nextInt() throws Exception {
		in.nextToken();
		return (int)in.nval;
	}  
	private static String nextString() throws Exception {
		in.nextToken();
		return in.sval;        
	}
} 