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 CodeJam;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class B {

	/**
	 * @param args
	 */
	static Scanner scan = new Scanner(System.in);
	static BufferedReader brscan = new BufferedReader(new InputStreamReader(System.in));
	static PrintWriter pw ;
	static ArrayList<Triplet> arrTriplet = new ArrayList<Triplet>(1000);
	public static void main(String[] args) throws NumberFormatException, IOException {
		pw = new PrintWriter("output-B.txt");
		// TODO Auto-generated method stub
		
		
		
		int tc = scan.nextInt();
		
		
		int googler, surprise, minscore;
		for (int x=1; x<=tc; x++) {
			arrTriplet.clear();
			googler = scan.nextInt();
			surprise = scan.nextInt();
			minscore = scan.nextInt();

			for (int n = 0; n<googler; n++ ) {				
				arrTriplet.add(ScoreToTriplet(scan.nextInt()));
			}
			
			Collections.sort(arrTriplet);
			
			// process //
			int pass = 0;
			for (int n = 0; n<googler; n++) {
				Triplet now = arrTriplet.get(n);
				if (now.getMax()>=minscore) {
					pass++;
				} else if (surprise>0){
					if (now.x == now.y && now.y == now.z) {
						if (now.x+1>=minscore && now.y>0) {
							pass++;
							surprise--;
						}
					} else if (now.x == now.y) {
						if (now.x+1>=minscore && now.y>0) {
							pass++;
							surprise--;
						}
					} 
					
				}
				
			}
			//debug();
			pw.println("Case #"+x+": "+pass);
		}
		pw.flush();
		pw.close();
	}
	
	public static void debug() {
		for (int n=0; n<arrTriplet.size(); n++) {
			pw.println(arrTriplet.get(n).toString());
		}
	}
	
	public static Triplet ScoreToTriplet(int score) {
		int average = score/3;
		
		int remain = score-average*3;
		if (remain==2) {
			return new Triplet(average+1, average+1, average);
		} else if (remain==1) {
			return new Triplet(average+1, average, average);
		} else {
			return new Triplet(average, average, average);
		}
	}

}



class Triplet implements Comparable<Triplet> {
	int x, y, z;
	public Triplet(int x, int y, int z) {
		this.x = x;
		this.y = y;
		this.z = z;
	}
	@Override
	public int compareTo(Triplet o) {
		// TODO Auto-generated method stub
		if (this.x!=o.x) {
			return o.x-this.x;
		}
		if (this.y!=o.y) {
			return o.y-this.y;
		}
		
		if (this.z!=o.z) {
			return o.z-this.z;
		}
		return 0;
	}
	
	public int getMax() {
		if (x>=y && x>=z) {
			return x;
		} 
		if (y>=x && y>=z) {
			return y;
		}
		return z;
	} 
	
	public int getMin() {
		if (x<=y && x<=z) {
			return x;
		}
		if (y<=z && y<=x) {
			return y;
		}
		return z;
	}
	
	public String toString() {
		return "["+x+","+y+","+z+"]";
	}

}