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();
  }


}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package googlecodejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;

/**
 *
 * @author Wouter
 */
public class DancingWithTheGooglers {

    ArrayList<String> cases = new ArrayList<String>();
    int makesit = 0;
    int needsSurp = 0;

    public DancingWithTheGooglers() {






        try {
            // Setup in/out
            System.setIn(new FileInputStream("C:\\GCJ\\B-large.in"));
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            BufferedWriter bw = new BufferedWriter(new FileWriter("C:\\GCJ\\B-large.out"));
            bw.flush();



            int untill = Integer.parseInt(br.readLine());

            for (int t = 1; t <= untill; t++) {

                String[] ins = br.readLine().split(" ");
                int n = Integer.parseInt(ins[0]); // number of googlers
                int s = Integer.parseInt(ins[1]); // number of surpirsing trips
                int p = Integer.parseInt(ins[2]); // min points
                int[] ti = new int[n];
                for (int i = 3; i < n + 3; i++) {
                    ti[i - 3] = Integer.parseInt(ins[i]);
                }
                for (int m = 0; m < ti.length; m++) {
                    doMath(ti[m], p);
                }

                int ans = makesit;
                if (s < needsSurp) {
                    ans += s;
                } else {
                    ans += needsSurp;
                }


                String out = "Case #" + t + ": " + ans;

                cases.add(out);
                makesit = 0;
                needsSurp = 0;

            }

            for (String s : cases) {
                System.out.println(s);
                bw.write(s);
                bw.flush();
                bw.newLine();
            }

        } catch (IOException ex) {
            System.out.println("SOMETHING WENT WRONG");
        }
    }

    public void doMath(int number, int p) {
        int start = 10;
        boolean done = false;
        while (true) {
            if (start + start + start == number) {
                if (start >= p) {
                    makesit++;
                    done = true;
                    break;
                }
                break;
            }
            if (start + start + start - 1 == number) {
                if (start >= p) {
                    makesit++;
                    done = true;
                    break;
                }
                break;
            }
            if (start + start - 1 + start - 1 == number) {
                if (start >= p) {
                    makesit++;
                    done = true;
                    break;
                }
                break;
            }
            start--;
        }
        if (!done) {
            start = 10;
            while (true) {
                if (start == 1) {
                    break;
                }
                if (start + (start - 1) + (start - 2) == number) {
                    if (start >= p) {
                        needsSurp++;
                        break;
                    }
                    break;
                }
                if (start + (start - 2) + (start - 2) == number) {
                    if (start >= p) {
                        needsSurp++;
                        break;
                    }
                    break;
                }
                start--;

            }
        }

    }

    public static void main(String[] args) {
        new DancingWithTheGooglers();

    }
}
