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.util.*;
import java.io.*;
import java.math.*;
import static java.lang.System.*;
import static java.lang.Math.*;
import static java.lang.Integer.*;

public class B {
	public static void main(String args[]) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		int t = parseInt(br.readLine());
		for(int z=1;z<=t;z++) {
			String ss[] = br.readLine().trim().split("\\s+");
			int T = parseInt(ss[0]);
			int S = parseInt(ss[1]);
			int p = parseInt(ss[2]);
			int[] arr = new int[T];
			for(int i=0;i<T;i++) {
				arr[i] = parseInt(ss[i+3]);
			}
			Arrays.sort(arr);
			int[][] div = new int[T][3];
			for(int i=0;i<T;i++) {
				div[i][0] = arr[i]/3;
				div[i][1] = (arr[i]-div[i][0])/2;
				div[i][2] = arr[i] - div[i][0] - div[i][1];
			}
			while(S-->0) {
				boolean ok = false;
				for(int i=0;i<T;i++) {
					if(div[i][2] < p) {
						switch(arr[i]%3) {
							case 0:
								if(div[i][2] == p-1 && div[i][0] > 0) {
									div[i][2]++;
									div[i][0]--;
									ok = true;
								}
								break;
							case 1:
								break;
							case 2:
								if(div[i][2] == p-1 && div[i][1] > 0) {
									div[i][2]++;
									div[i][1]--;
									ok = true;
								}
								break;
						}
					}
					if(ok) {
						// out.println(Arrays.toString(div[i]));
						break;
					}
				}
				// if(!ok) {
					// for(int i=0;i<T;i++) {
						// if(!isSup(div[i]) && canBeSup(div[i])) {
							// div[i] = sup(div[i]);
							// ok = true;
						// }
						// if(ok) break;
					// }
				// }
			}
			int count = 0;
			for(int i=0;i<T;i++) {
				if(div[i][2] >= p) count++;
				// out.println(div[i][0]+" "+div[i][1]+" "+div[i][2]);
			}
			out.println("Case #"+z+": "+count);
		}
	}
	
	static boolean isSup(int[] div) {
		return (div[2] - div[0] == 2);
	}
	
	static boolean canBeSup(int[] div) {
		return div[0] != 0;
	}	
	
	static int[] sup(int[] div) {
		if(div[0] == div[2]) return new int[]{div[0]-1,div[1],div[2]+1};
		else if(div[1] == div[2]) return new int[]{div[0],div[1]-1,div[2]+1};
		else return new int[]{div[0]-1,div[1]+1,div[2]};
	}
}