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


public class Dancing {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for(int tc = 1 ; tc <= T ; tc++ ) {
			int N = reader.nextInt();
			int S = reader.nextInt();
			int p = reader.nextInt();
			int [] arr = new int[N];
			for(int i = 0 ; i < N ; i ++) {
				arr[i] = reader.nextInt();
			}
			int res = doit(arr, S, p);
			System.out.printf("Case #%d: %d\n", tc, res);
		}
	}

	private static int doit(int[] arr, int s, int p) {
		int n = arr.length;
		Triplet[] ts = new Triplet[n];
		for(int i = 0 ; i < n ; i ++) {
			ts[i] = new Triplet(arr[i]);
		}
		Arrays.sort(ts);
		int count = 0;
		for(int i = 0 ; i < arr.length; i ++) {
			if ( ts[i].max >= p) {
				count ++;
//				System.out.println(ts[i].total + " used");
				continue;
			}
			if( s > 0 && ts[i].surprisingMax >= p) {
				s--;
				count ++;
//				System.out.println(ts[i].total + " used");
				continue;
			}
//			System.out.println(ts[i].total + "  " + s + p);
		}
		return count;
	}
}

class Triplet implements Comparable<Triplet> {
	int total;
	int max;
	int surprisingMax;
	public Triplet(int total) {
		this.total = total;
		initialize();
	}
	private void initialize() {
		int avg = total / 3;
		int remaining = total % 3;
		int a[] = new int[3];
		a[0] = avg;
		a[1] = avg;
		a[2] = avg;
		if(remaining > 0) {
			a[0]++;
		}
		if(remaining > 1) {
			a[1]++;
		}
		this.max = a[0];
		switch(remaining) {
		case 0:
		case 2:
			this.surprisingMax = a[0] + (a[1] > 0 ? 1 : 0);
			break;
		case 1:
			this.surprisingMax = -1;
			break;
		}
//		System.out.println("total: " + total + " max: " + max + " remaining: " + remaining + " surp max: " + surprisingMax);
	}
	@Override
	public int compareTo(Triplet o) {
		if(o.total != total) {
			return o.total - total;
		}
		if(o.max != max) {
			return o.max - max;
		}
		return o.surprisingMax - surprisingMax;
	}
}
