/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}


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

}
