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


}

/**
 * 
 */
package kr.javanese.gcj2012.qr.b;

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;

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

	private int findMax(int s, int p, int[] t) {
		int n = t.length;
		int[] tremaining = new int[t.length];
		int bmin[] = new int[t.length]; // min of possible best scores
		int bmax[] = new int[t.length]; // max of possible best scores
		boolean[] shouldBeSuprising = new boolean[n];
		
		int count = 0;
		int shouldBeSuprisingCount = 0;
		for (int i=0; i<n; i++) {
			tremaining[i] = t[i] % 3;
			switch(tremaining[i])
			{
			case 0:
				if (t[i]==0) {
					bmin[i] = 0;
					bmax[i] = 0;
				} else {
					bmin[i] = t[i]/3;
					bmax[i] = t[i]/3+1;
				}
				if (bmin[i]>=p) {
					count++;
				} else if (bmax[i]==p) {
					shouldBeSuprising[i] = true;
					shouldBeSuprisingCount++;
				}
				break;
			case 1:
				bmin[i] = t[i]/3+1;
				bmax[i] = t[i]/3+1;
				if (bmin[i]>=p) {
					count++;
				}
				break;
			case 2:
				bmin[i] = t[i]/3+1;
				bmax[i] = t[i]/3+2;
				if (bmin[i]>=p) {
					count++;
				} else if (bmax[i]==p) {
					shouldBeSuprising[i] = true;
					shouldBeSuprisingCount++;
				}
				break;
			}
			System.err.println(">> "+i+": "+bmin[i]+", "+bmax[i]+", "+count+"["+shouldBeSuprisingCount+"]");
		}
		
		if (shouldBeSuprisingCount>=s) {
			count += s;
		} else {
			count += shouldBeSuprisingCount;
		}
		return count;
	}

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

			BufferedReader reader;
			if (args.length > 0) {
				reader = new BufferedReader(new FileReader(args[0]));
			} else {
				reader = new BufferedReader(new InputStreamReader(System.in));
			}
			String line = null;
			line = reader.readLine();
			int caseCount = Integer.parseInt(line);

			long startTime = System.currentTimeMillis();

			for (int i = 0; i < caseCount; i++) {
				line = reader.readLine();
				String[] tokens = line.split(" ");
				int n = Integer.parseInt(tokens[0]);
				int s = Integer.parseInt(tokens[1]);
				int p = Integer.parseInt(tokens[2]);
				int t[] = new int[n];
				for (int j=0; j<n; j++) {
					t[j] = Integer.parseInt(tokens[j+3]);
				}
				
				System.out.print("Case #");
				System.out.print(i + 1);
				System.out.print(": ");
				System.out.println(instance.findMax(s, p, t));
			}

			System.err.println("Elasped Time : "
					+ (System.currentTimeMillis() - startTime));
			reader.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
