package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

import java.io.*;
import java.util.*;

public class codejam2 {
	
	static class triplet {
		
		int a, b, c;
		int maxdiff;
		
		public triplet(int pa, int pb, int pc) {
			a = pa;
			b = pb;
			c = pc;
			maxdiff = maxdiff();
			if (pa < 0 || pb < 0 || pc < 0) maxdiff = 3;
		}
		
		public boolean isSurprising() {
			return Math.abs(a-b) == 2 || Math.abs(a-c) == 2 || Math.abs(b-c) == 2;
		}
		
		public int maxdiff() {
			return Math.max(Math.abs(a-c), Math.max(Math.abs(a-b), Math.abs(b-c)));
		}
	}

	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader(new FileReader("B-small-attempt0.in"));
		int T;
		
		T = Integer.parseInt(f.readLine());
		StringTokenizer t;
		
		for (int q = 0; q < T; q++) {
			int N, S, p;
			triplet[] ts;
			boolean[] sat;
			t = new StringTokenizer(f.readLine());
			N = Integer.parseInt(t.nextToken());
			S = Integer.parseInt(t.nextToken());
			p = Integer.parseInt(t.nextToken());
			ts = new triplet[N];
			sat = new boolean[N];
			int surpcount = 0;
			for (int i = 0; i < N; i++) {
				int n = Integer.parseInt(t.nextToken());
				int diff = n - (3 * (n/3));
				if (diff == 0 || diff == 1) {
					ts[i] = new triplet(n/3, n/3, n/3 + diff);
				}
				if (diff == 2) {
					ts[i] = new triplet(n/3, n/3+1, n/3+1);
				}
			}
			
			for (int i = 0; i < N; i++) {
				if (ts[i].c >= p) {
					sat[i] = true;
					continue;
				}
				
				triplet newtrip = new triplet(ts[i].a, ts[i].b-1, ts[i].c+1);
				if (newtrip.maxdiff == 1 && (newtrip.c >= p)) {
					sat[i] = true;
					continue;
				}
				if (surpcount >= S) continue;
				
				if (newtrip.maxdiff == 2 && (newtrip.c >= p)) {
					sat[i] = true;
					surpcount++;
					continue;
				}
				
				triplet newnewtrip = new triplet(ts[i].a - 1, ts[i].b-1, ts[i].c+2);
				if (newnewtrip.maxdiff == 2 && (newtrip.c >= p)) {
					sat[i] = true;
					continue;
				}
				
			}
			int tot = 0;
			for (int i = 0; i < N; i++) {
				if (sat[i]) {
					tot++;
				}
			}
			System.out.println("Case #" + (q+1) + ": " + tot);
		}
	}

}
