import java.util.*;
public class Test {
  public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    int T = in.nextInt();

    for(int i = 1; i<=T; i++) {
      int n = in.nextInt();
      int s = in.nextInt();
      int p = in.nextInt();
      int result = 0;
      for(int j = 0; j<n; j++){
        int x = canAddUp(in.nextInt(), p);
        if(x == 0) {
          result++;
        } else if (x==1 && s > 0) {
          result++;
          s--;
        }
      }
      System.out.println("Case #"+i+": "+result);
    }
  }

  public static int canAddUp(int sum, int limit) {
    boolean flag = false;
    for(int i = 0; i<=sum; i++) {
      for(int j = 0; i+j <= sum; j++) {
        int k = sum-(i+j);
        int a = Math.abs(i-j);
        int b = Math.abs(i-k);
        int c = Math.abs(j-k);
        if(a > 2 || b > 2 || c> 2){
          continue;
        }

        if (i>=limit || j>=limit || k>=limit) {
          if(a < 2 && b < 2 && c < 2) {
            return 0;
          }else{
            flag = true;
          }
        }
      }
    }
    return (flag) ? 1 : 2;
  }
}


public class GooglersDance {
	
	boolean surprising = true;
	
	public int maxDancers(int n, int s,int p, int[] t) {
		
		int len = t.length;
		int winners = 0;
		
		for(int i = 0; i < n; i++) {
			
			if(checkWinner(p,t[i],!surprising)) {
				
				winners++;
				continue;
				
			}
			if(s > 0 && checkWinner(p,t[i],surprising)) {
				
				winners++;
				s--;
				
			}
			
		}
		
		return winners;
		
	}

	private boolean checkWinner(int p, int t, boolean surprisingWanted) {
		
		if(!surprisingWanted) {
		
			if(((t-1) % 3) == 0) {
				
				int a = (t-1)/3;
				if(a >= 0 && a+1 >= p) {
					
					return true;
					
				}
				else {
					
					return false;
					
				}
				
			}
			else if(((t-2) % 3) == 0) {
				
				int a = (t-2)/3;
				if(a >= 0 && a+1 >= p) {
					
					return true;
					
				}
				else {
					
					return false;
					
				}
				
			}
			else {
				
				int a = t/3;
				if(a >= p) {
					
					return true;
					
				}
				else {
					
					return false;
					
				}
				
			}
			
		}
		else {
			
			int a = 0;
			switch(t % 3) {
			
			case 0 : 
				a = t/3 - 1;
				break;
			case 1 : 
				a = (t-4)/3;
				break;
			case 2 : 
				a = (t-2)/3;
				break;
			
			}
			if(a >= 0 && a+2 >= p) {
				
				return true;
				
			}
			else {
				
				return false;
				
			}
			
		}
		
		
	}

}
