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.File;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.Scanner;


public class DancingWiththeGooglers {
	
	enum Type{
		A{
			@Override
			public int getNoSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return (value+1)/3;
			}

			@Override
			public int getSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return (value+1)/3+1;
			}
		},
		B{
			@Override
			public int getNoSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return (value)/3;
			}

			@Override
			public int getSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return (value)/3+1;
			}
		},
		C{
		
			@Override
			public int getNoSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return (value-1)/3+1;
			}

			@Override
			public int getSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return (value-1)/3+1;
			}
		},
		ZERO{
			
			@Override
			public int getNoSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return 0;
			}

			@Override
			public int getSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return 0;
			}
		},
		ONE{
			@Override
			public int getNoSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return 1;
			}

			@Override
			public int getSurpiseHigh(int value) {
				// TODO Auto-generated method stub
				return 1;
			}
		};
		public static Type valueOf(int value){
			switch (value){
			case 0: return Type.ZERO;
			case 1: return Type.ONE;
			default: 
				switch (value%3){
				case 0: return B;
				case 1: return C;
				case 2: return A;
				default: return null;
				}
			}
			
		}
		int value;
		public abstract int getSurpiseHigh(int value);
		public abstract int getNoSurpiseHigh(int value);
	}

	
	public static void main(String args[]) throws FileNotFoundException{
		//System.setOut(new PrintStream(new File("DancingWiththeGooglers.txt")));
		
		Scanner scanner = new Scanner(System.in);
		int testcasenum = Integer.valueOf(scanner.next());
		scanner.nextLine();
		for (int testcase = 0;testcase < testcasenum;testcase++){
			int googlersnum = scanner.nextInt();
			int surpisesnum = scanner.nextInt();
			int atleast = scanner.nextInt();
			//int totals[] = new int[googlersnum];
			int maximum = 0;
			for (int index = 0;index < googlersnum;index++){
				int total = scanner.nextInt();
				Type type = Type.valueOf(total);
				//System.out.println(type);
				//System.out.println(type.getNoSurpiseHigh(total));
				if (type != Type.ZERO && type != Type.ONE && type != Type.C && type.getSurpiseHigh(total) == atleast && surpisesnum > 0){
					maximum++;
					surpisesnum--;
				}else if (type.getNoSurpiseHigh(total) >= atleast){
					maximum++;
				}
			}
			
			System.out.print("Case #");
			System.out.print(testcase+1);
			System.out.print(": ");
			System.out.println(maximum);
		}
	}
}
