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

import static java.lang.Math.*;

public class B {
	
	public class Tripple {
		Integer t1, t2, t3;

		public Tripple() {
		}

		@Override
		public String toString() {
			return "(" + t1 + ", " + t2 + ", " + t3 + ")";
		}
	}
	
	public static void main(String[] args) throws Exception {
		B b = new B();
		b.run(args);
	}

	public void run(String[] args) throws Exception {
		
		Scanner in = (args.length > 0) ? new Scanner(new File(args[0])) : new Scanner(System.in);
		int T = in.nextInt();
		for(int zz = 1; zz <= T;zz++){
			System.err.format("#%d\n", zz);
			System.out.format("Case #%d: ", zz);

			int N = in.nextInt();
			int S = in.nextInt();
			int s = S;
			int p = in.nextInt();
			
			int tps[] = new int[N];
			int count = 0;
			for (int n = 0; n < N; n++) {
				tps[n] = in.nextInt();
				Tripple tripple = new Tripple();
				int tp = tps[n];
				s = tripple(tp, p, s, tripple);
				if (s >= 0 && tripple.t1 != null && tripple.t1 >= p) {
					count++;
				}
				System.err.println(tp + "_" + p + " : " + tripple + " ... " + s + " c: " + count);
			}
			
			System.out.format("%d\n", count);
		}
	}

	private int tripple(int tp, int p0, int s, Tripple t) {
		if (s < 0 || tp < p0) {
			t.t1 = null;
			return s;
		}

		int p = p0;
		boolean possible1 = false;
		while(!possible1) {
			possible1 = true;
		
			int r = tp;
			t.t1 = p;
			r -= p;
			
			int p2 = p;
			
			boolean possible = false;
			int run = 0;
			while(!possible) {
				run++;
				t.t2 = p2;
				int r2 = r - p2;
				t.t3 = r2;
				if (t.t2 + 1 >= p && t.t3 + 1 >= p) {
					possible = true;
				} else if (t.t2 + 2 >= p && t.t3 + 2 >= p && run > 1) {
					
					if (s <= 0) {
						p--;
						possible1 = false;
					} else {
						s--;
					}
					possible = true;
					
				} else if (p2 < 1) {
					t.t1 = null;
					return s;
				} else {
					p2--;
				}
			}
			
			if (t.t3 > p) {
				p++;
				possible1 = false;
			}
			
		}
		return s;
	}
}
