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.IOException;


public class DancingGooglers extends FileReaderWriter {

	/*//int[] GOOG = {29, 20, 8, 18, 18, 21};
	int[] GOOG = {23, 22, 21};*/
	
	DancingGooglers(String inPath, String outPath) throws IOException {
		super(inPath, outPath);
		reader();
		
	}
	
	@Override
	public void reader() throws IOException {
		super.writer();
		strLine = br.readLine();
		nTestCases = Integer.valueOf(strLine);
		
		int N, S, p;
		int nthCase = 0;
		
		int googlerCount = 0;
		
		String toWrite = new String();
		
		
		//While LOOP
		while( (strLine = br.readLine()) != null ) {
			googlerCount = 0;
			++nthCase;
			toWrite = toWrite + "Case #" + nthCase + ": ";
			String[] handler = strLine.split(" ");
			
			int[] GOOG = new int[handler.length];
			
			for(int i=0; i<handler.length; ++i) {
				GOOG[i] = Integer.valueOf(handler[i]);
			}
			
			N = GOOG[0];
			S = GOOG[1];
			p = GOOG[2];
			
			for(int i=3; i<GOOG.length; ++i) {
				int base = (int) GOOG[i] / 3;
				
				switch (GOOG[i] % 3) 
				{
					case 0:
					{
						if(base >= p)
							++googlerCount;
						else {
							if(S>0 && base>0 && base+1>=p) {
								++googlerCount;
								--S;
							}
						}
						break;
					}
					
					case 1:
					{
						if(base >= p || base+1 >= p) {
							++googlerCount;
						}
						else {
							if(S > 0 && base + 1 >= p) {
								++googlerCount;
								S--;
							}
						}
						break;
					}
					
					case 2:
					{
						if(base + 1 >= p || base >= p) {
							++googlerCount;
						}
						else {
							if(S > 0 && base + 2 >= p) {
								++googlerCount;
								--S;
							}
						}
						break;
					}
				}				
			}
			toWrite = toWrite + googlerCount + "\n";			
		}
		System.out.println(toWrite);
		bw.write(toWrite);
		bw.close();
	}

}
