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

public class Qualify {

	public static void main(String[] args) {
		try {
			BufferedReader reader = new BufferedReader(new FileReader(new File("B-small-attempt3.in")));
			int cases = Integer.parseInt(reader.readLine());
			for (int d = 0; d < cases; d++) {

				// parse
				String line = reader.readLine();
				String[] spLine = line.split(" ");
				int googs = Integer.parseInt(spLine[0]);
				int surprises = Integer.parseInt(spLine[1]);
				int prize = Integer.parseInt(spLine[2]);
				Googler[] googArr = new Googler[googs];

				// find the solutions for each googler
				for (int r = 0; r < googs; r++) {
					googArr[r] = new Googler();
					Integer total = Integer.parseInt(spLine[(r + 3)]);
					googArr[r].poss(total, prize);

				}

				// sort the array based on how many possibilities it has
				Arrays.sort(googArr, new Comparator<Googler>() {
					@Override
					public int compare(Googler o1, Googler o2) {
						// TODO Auto-generated method stub
						return new Integer(o1.trueCounter)
								.compareTo(o2.trueCounter);
					}
				});

				int surCounter = 0;
				int winCounter = 0;
				/*
				 * boolean prizeSurprise = false; boolean prizeNoSurprise =
				 * false; boolean failSurprise = false; boolean failNoSurprise =
				 * false;
				 */
				for (int i = 0; i < googs; i++) {
					if (googArr[i].trueCounter == 1) {
						if (googArr[i].prizeSurprise == true) {
							winCounter++;
							surCounter++;
							googArr[i].used = true;
						} else if (googArr[i].prizeNoSurprise == true) {
							winCounter++;
							googArr[i].used = true;
						} else if (googArr[i].failSurprise == true) {
							surCounter++;
							googArr[i].used = true;
						} else {
							// nothing to do with this
							googArr[i].used = true;
						}
					}
				}

				for (int i = 0; i < googs && surCounter < surprises; i++) {
					if (googArr[i].used == false) {
						if (googArr[i].prizeSurprise == true && googArr[i].prizeNoSurprise == false) {
							winCounter++;
							surCounter++;
							googArr[i].used = true;
							break;
						}
					}
				}
				
				for (int i = 0; i < googs && surCounter < surprises; i++) {
					if (googArr[i].used == false) {
						if (googArr[i].prizeSurprise == true) {
							winCounter++;
							surCounter++;
							googArr[i].used = true;
							break;
						}
					}
				}

				for (int i = 0; i < googs && surCounter < surprises; i++) {
					if (googArr[i].used == false) {
						if (googArr[i].failSurprise == true) {
							surCounter++;
							googArr[i].used = true;
						}
					}
				}

				for (int i = 0; i < googs; i++) {
					if (googArr[i].used == false) {
						if (googArr[i].prizeNoSurprise) {
							winCounter++;
							googArr[i].used = true;
						}
					}
				}

				System.out.println("Case #" + (d+1) + ": " + winCounter);

			}

		} catch (Exception ex) {
			ex.printStackTrace();
		}

	}

}
