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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.StringTokenizer;


public class Bversion2 {
	public static void main(String[] args) throws IOException {
		BufferedReader br=new BufferedReader(new FileReader("codejamb.in"));
		BufferedWriter brout=new BufferedWriter(new FileWriter("codejamb.out"));
		StringTokenizer sb=new StringTokenizer(br.readLine());
		int t=Integer.parseInt(sb.nextToken());
		int n;
		int p;
		int surprising;
		int[] values;
		for(int l=1;l<=t;l++) {
			sb=new StringTokenizer(br.readLine());
			n=Integer.parseInt(sb.nextToken());
			surprising=Integer.parseInt(sb.nextToken());
			p=Integer.parseInt(sb.nextToken());
			int result=0;
			values=new int[n];
			for(int i=0;i<n;i++) {
				values[i]=Integer.parseInt(sb.nextToken());
			}
		    for(int i=0;i<n;i++) {
		    	int x=calcifpossible(values[i],p);
		    	if(x==1) {
		    		
		    	}
		    	else if(surprising>0) {
		    		x=calcifSur(values[i],p);
		    		if(x==1)
		    		surprising--;
		    	}
		    	result+=x;
		    }
		
			brout.write("Case #"+l+": "+result+"\n");
		}
		brout.close();
		return;
	}
	public static int calcifpossible(int k,int p) {
		int kk=k%3;
		int ifnotsurprising=0;
		int num1not=0,num2not=0,num3not=0;
		switch(kk) {
		case 0:
			
				num1not=k/3;
				num2not=k/3;
				num3not=k/3;
			
			break;
		case 1:
			
				num1not=k/3;
				num2not=k/3;
				num3not=k/3+1;
			
		
			break;
		case 2:
			
			num1not=k/3;
			num2not=k/3+1;
			num3not=k/3+1;
			break;
		}
		if(num1not>=p) {
			ifnotsurprising++;
		}
		if(num2not>=p) {
			ifnotsurprising++;
		}
		if(num3not>=p) {
			ifnotsurprising++;
		}
		if(ifnotsurprising>0) return 1;
		else return 0;
		
	}
	public static int calcifSur(int k,int p) {
		int num1s=0;
		int num2s=0;
		int num3s=0;
		int kk=k%3;
		int ifsurprising=0;
		switch(kk) {
		case 0:
			if(k==30 || k==0) {
				num1s=k/3;
				num2s=k/3;
				num3s=k/3;
			} else {
				num1s=k/3-1;
				num2s=k/3;
				num3s=k/3+1;
				
			}
			
			break;
		case 1:
			if(k==1) {
				num1s=k/3;
				num2s=k/3;
				num3s=k/3+1;
				
			} else {
				num1s=k/3-1;
				num2s=k/3+1;
				num3s=k/3+1;
				
			}
		
			break;
		case 2:
			num1s=k/3;
			num2s=k/3;
			num3s=k/3+2;
			
			break;
		}
		if(num1s>=p) {
			ifsurprising++;
		}
		if(num2s>=p) {
			ifsurprising++;
		}
		if(num3s>=p) {
			ifsurprising++;
		}
		if(ifsurprising>0) return 1;
		else return 0;
	}
	public static int getAnswer(int[] x,int p,int surprisingleft,int start) {
		if(x.length-start<surprisingleft) {
			return Integer.MIN_VALUE;
		}
		if(start>=x.length && surprisingleft!=0) {
			return Integer.MIN_VALUE;
		}
		if(start==x.length && surprisingleft==0) {
			return 0;
		}
		boolean flag=false;
		if(surprisingleft==0) {
			flag=true;
		}
		int ifsurprising=0;
		int ifnotsurprising=0;
		int k=x[start]%3;
		int num1s=0;
		int num2s=0;
		int num3s=0;
		int num1not=0;
		int num2not=0;
		int num3not=0;
		switch(k) {
		case 0:
			if(x[start]==30 || x[start]==0) {
				num1not=x[start]/3;
				num2not=x[start]/3;
				num3not=x[start]/3;
				num1s=x[start]/3;
				num2s=x[start]/3;
				num3s=x[start]/3;
			} else {
				num1s=x[start]/3-1;
				num2s=x[start]/3;
				num3s=x[start]/3+1;
				num1not=x[start]/3;
				num2not=x[start]/3;
				num3not=x[start]/3;	
			}
			
			break;
		case 1:
			if(x[start]==1) {
				num1s=x[start]/3;
				num2s=x[start]/3;
				num3s=x[start]/3+1;
				num1not=x[start]/3;
				num2not=x[start]/3;
				num3not=x[start]/3+1;
			} else {
				num1s=x[start]/3-1;
				num2s=x[start]/3+1;
				num3s=x[start]/3+1;
				num1not=x[start]/3;
				num2not=x[start]/3;
				num3not=x[start]/3+1;
			}
		
			break;
		case 2:
			num1s=x[start]/3;
			num2s=x[start]/3;
			num3s=x[start]/3+2;
			num1not=x[start]/3;
			num2not=x[start]/3+1;
			num3not=x[start]/3+1;
			break;
		}
		if(num1s>=p) {
			ifsurprising++;
		}
		if(num2s>=p) {
			ifsurprising++;
		}
		if(num3s>=p) {
			ifsurprising++;
		}
		if(num1not>=p) {
			ifnotsurprising++;
		}
		if(num2not>=p) {
			ifnotsurprising++;
		}
		if(num3not>=p) {
			ifnotsurprising++;
		}
		if(flag) {
			if(ifnotsurprising>0)
			return getAnswer(x,p,surprisingleft,start+1)+1;
			else 
				return getAnswer(x,p,surprisingleft,start+1);
		}
		else {
			int acc21=0;
			int acc22=0;
			if(ifsurprising>0) {
				acc21=1;
			}
			if(ifnotsurprising>0) {
				acc22=1;
			}
		    
		if(getAnswer(x,p,surprisingleft-1,start+1)+acc21> getAnswer(x, p, surprisingleft, start+1)+acc22)
			return getAnswer(x,p,surprisingleft-1,start+1)+acc21;
		else 
			return getAnswer(x, p, surprisingleft, start+1)+acc22;
	   }
		
	}
}

