import java.util.*;
import java.io.*; 
import java.text.*;
//Solution Credits: Taranpreet Singh
public class Main{
    //SOLUTION BEGIN
    int[] a;// min;
    long[] f = new long[51], fi = new long[51];
    void pre(){
        f[0] = 1;fi[0] = 1;
        for(int i = 1; i<= 50; i++){f[i] = (f[i-1]*i)%mod;fi[i] = modPow(f[i], mod-2);}
    }
    long modPow(long a, long p){
        long o = 1;
        while(p>0){
            if(p%2==1)o = (o*a)%mod;
            a = (a*a)%mod;
            p>>=1;
        }
        return o;
    }
    int c = 0;
    void solve(int TC) throws Exception{
        int n = ni(), s = ni();c=0;
        a = new int[n];
        for(int i = 0; i< n; i++){
            int x = ni();
            if(x>=0){a[c++] = x;s-=a[c-1];}
        }
        pn(count(c, s, 1));
    }
    
    long count(int pos,int s, int v){
        if(pos==a.length){
            if(s>0)return 0;
            long ans = 0;
            for(int i = 0; i< a.length; i++)
                for(int j = i+1; j< a.length; j++)
                    ans+=gcd(a[i], a[j]);
            int cnt = 1;
            for(int i = c+1; i< a.length; i++){
                if(a[i]==a[i-1])cnt++;
                else {
                    ans = (ans*fi[cnt])%mod;
                    cnt = 1;
                }
            }
            ans = (ans*fi[cnt])%mod;
            return (ans*f[a.length-c])%mod;
        }
        long ans = 0;
        for(int i = v; i<= s-(a.length-pos-1); i++){
            a[pos] = i;
            ans = (ans+count(pos+1, s-i, i))%mod;
        }
        return ans;
    }
    //SOLUTION ENDS
    long mod = (long)1e9+7, IINF = (long)1e17;
    final int MAX = (int)1e6+1, INF = (int)2e9, root = 3;
    DecimalFormat df = new DecimalFormat("0.000000000000");
    double PI = 3.1415926535897932384626433832792884197169399375105820974944, eps = 1e-8;
    static boolean multipleTC = true, memory = false;
    FastReader in;PrintWriter out;
    void run() throws Exception{
        in = new FastReader();
        out = new PrintWriter(System.out);
        int T = (multipleTC)?ni():1;
        //Solution Credits: Taranpreet Singh
        pre();
        for(int i = 1; i<= T; i++)solve(i);
        out.flush();
        out.close();
    }
    public static void main(String[] args) throws Exception{
        if(memory)new Thread(null, new Runnable() {public void run(){try{new Main().run();}catch(Exception e){e.printStackTrace();}}}, "1", 1 << 28).start();
        else new Main().run();
    }
    long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
    int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
    int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}
    void p(Object o){out.print(o);}
    void pn(Object o){out.println(o);}
    void pni(Object o){out.println(o);out.flush();}
    String n(){return in.next();}
    String nln(){return in.nextLine();}
    int ni(){return Integer.parseInt(in.next());}
    long nl(){return Long.parseLong(in.next());}
    double nd(){return Double.parseDouble(in.next());}

    class FastReader{
        BufferedReader br;
        StringTokenizer st;
        public FastReader(){
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FastReader(String s) throws Exception{
            br = new BufferedReader(new FileReader(s));
        }

        String next(){
            while (st == null || !st.hasMoreElements()){
                try{
                    st = new StringTokenizer(br.readLine());
                }catch (IOException  e){
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        String nextLine(){
            String str = "";
            try{    
                str = br.readLine();
            }catch (IOException e){
                e.printStackTrace();
            }   
            return str;
        }
    }
}