Let's define the niceness of a sequence of positive integers X1,X2,…,XN$X_1, X_2, \dots, X_N$ as the sum of greatest common divisors of all pairs of its elements, i.e.
N∑i=1N∑j=i+1gcd(Xi,Xj).∑i=1N∑j=i+1Ngcd(Xi,Xj).\sum_{i=1}^N \sum_{j=i+1}^N \mathrm{gcd}(X_i, X_j)\;.
For example, the niceness of the sequence [1,2,2]$[1, 2, 2]$ is gcd(1,2)+gcd(1,2)+gcd(2,2)=4$gcd(1, 2) + gcd(1, 2) + gcd(2, 2) = 4$.
You are given a sequence A1,A2,…,AN$A_1, A_2, \dots, A_N$; each of its elements is either a positive integer or missing.
Consider all possible ways to replace each missing element of A$A$ by a positive integer (not necessarily the same for each element) such that the sum of all elements is equal to S$S$. Your task is to find the total niceness of all resulting sequences, i.e. compute the niceness of each possible resulting sequence and sum up all these values. Since the answer may be very large, compute it modulo 109+7$10^9 + 7$.

-----Input-----
- The first line of the input contains a single integer T$T$ denoting the number of test cases. The description of T$T$ test cases follows.
- The first line of each test case contains two space-separated integers N$N$ and S$S$. 
- The second line contains N$N$ space-separated integers A1,A2,…,AN$A_1, A_2, \dots, A_N$. Missing elements in this sequence are denoted by −1$-1$.

-----Output-----
For each test case, print a single line containing one integer — the total niceness modulo 109+7$10^9 + 7$.

-----Constraints-----
- 1≤T≤20$1 \le T \le 20$
- 1≤N,S≤50$1 \le N, S \le 50$
- 1≤Ai≤50$1 \le A_i \le 50$ or Ai=−1$A_i = -1$ for each valid i$i$

-----Subtasks-----
Subtask #1 (30 points):
- 1≤N,S≤18$1 \le N, S \le 18$
- 1≤Ai≤18$1 \le A_i \le 18$ or Ai=−1$A_i = -1$ for each valid i$i$
Subtask #2 (70 points): original constraints

-----Example Input-----
3
3 3
1 1 -1
4 8
1 -1 -1 3
3 10
-1 -1 -1

-----Example Output-----
3
23
150

-----Explanation-----
Example case 1: There is only one possible way to fill in the missing element; the resulting sequence is [1,1,1]$[1, 1, 1]$. Its niceness is 3$3$.
Example case 2: There is only three possible ways to fill in the missing elements; the resulting sequences are [1,1,3,3]$[1, 1, 3, 3]$, [1,3,1,3]$[1, 3, 1, 3]$, and [1,2,2,3]$[1, 2, 2, 3]$. The sum of their niceness is 8+8+7=23$8 + 8 + 7 = 23$.

Difficulty: interview

Starter code:

Solutions:
# cook your dish here
mod = 10**9 + 7
from math import gcd
def fac50():
    f = [0]*51
    f[0] ,f[1] = 1,1
    for i in range(1,51):f[i] = (f[i-1]*i)%mod
    return f
def gcd110():
    gc = [[0]*111 for i in range(111)]
    for i in range(111):
        for j in range(111):gc[i][j] = gcd(i,j)
    return gc
factorials,gcds = fac50(),gcd110()
def rule_asc(n,l):
    a,k = [0 for i in range(n + 1)],1
    a[1] = n
    while k != 0:
        x,y = a[k - 1] + 1,a[k] - 1 
        k -= 1
        while x <= y and k < l - 1:
            a[k],y = x,y-x
            k += 1
        a[k] = x + y
        yield a[:k + 1]
def niceness(s):
    t = 0
    for i in range(len(s)):
        for j in range(i+1,len(s)):t = (t + gcds[s[i]][s[j]])%mod
    return t
def permcount(s,c):
    f,p = [s.count(x) for x in set(s)],factorials[c] 
    for e in f:p = (p*pow(factorials[e],mod-2,mod))%mod
    return p
def main():
    for i in range(int(input())):
        n,s = [int(item) for item in input().split()]
        a = [int(item) for item in input().split()]
        b = [i for i in a if i != -1]
        s , ones = s - sum(b),a.count(-1)         
        if s < 0:print(0)
        elif (s == 0 and ones == 0):print(niceness(a)%mod)
        elif (s > 0 and ones == 0):print(0)
        else:
            t = 0
            for seq in rule_asc(s,ones):
                if len(seq) == ones: t = (t + (((permcount(seq,ones))%mod)*(niceness(b+seq)%mod))%mod)%mod
            print(t)         
def __starting_point():main()
__starting_point()

# cook your dish here
mod = 10**9 + 7
from math import gcd
def fac50():
    f = [0]*51
    f[0] ,f[1] = 1,1
    for i in range(1,51):f[i] = (f[i-1]*i)%mod
    return f
def gcd110():
    gc = [[0]*111 for i in range(111)]
    for i in range(111):
        for j in range(111):gc[i][j] = gcd(i,j)
    return gc
factorials,gcds = fac50(),gcd110()
def rule_asc(n,l):
    a,k = [0 for i in range(n + 1)],1
    a[1] = n
    while k != 0:
        x,y = a[k - 1] + 1,a[k] - 1 
        k -= 1
        while x <= y and k < l - 1:
            a[k],y = x,y-x
            k += 1
        a[k] = x + y
        yield a[:k + 1]
def niceness(s):
    t = 0
    for i in range(len(s)):
        for j in range(i+1,len(s)):t = (t + gcds[s[i]][s[j]])%mod
    return t
def permcount(s,c):
    f,p = [s.count(x) for x in set(s)],factorials[c] 
    for e in f:p = (p*pow(factorials[e],mod-2,mod))%mod
    return p
def main():
    for i in range(int(input())):
        n,s = [int(item) for item in input().split()]
        a = [int(item) for item in input().split()]
        b = [i for i in a if i != -1]
        s , ones = s - sum(b),a.count(-1)         
        if s < 0:print(0)
        elif (s == 0 and ones == 0):print(niceness(a)%mod)
        elif (s > 0 and ones == 0):print(0)
        else:
            t = 0
            for seq in rule_asc(s,ones):
                if len(seq) == ones: t = (t + (((permcount(seq,ones))%mod)*(niceness(b+seq)%mod))%mod)%mod
            print(t)         
def __starting_point():main()
__starting_point()

mod = 10**9 + 7
from math import gcd
def fac50():
    f = [0]*51
    f[0] ,f[1] = 1,1
    for i in range(1,51):f[i] = (f[i-1]*i)%mod
    return f
def gcd110():
    gc = [[0]*111 for i in range(111)]
    for i in range(111):
        for j in range(111):gc[i][j] = gcd(i,j)
    return gc
factorials,gcds = fac50(),gcd110()
def rule_asc(n,l):
    a,k = [0 for i in range(n + 1)],1
    a[1] = n
    while k != 0:
        x,y = a[k - 1] + 1,a[k] - 1 
        k -= 1
        while x <= y and k < l - 1:
            a[k],y = x,y-x
            k += 1
        a[k] = x + y
        yield a[:k + 1]
def niceness(s):
    t = 0
    for i in range(len(s)):
        for j in range(i+1,len(s)):t = (t + gcds[s[i]][s[j]])%mod
    return t
def permcount(s,c):
    f,p = [s.count(x) for x in set(s)],factorials[c] 
    for e in f:p = (p*pow(factorials[e],mod-2,mod))%mod
    return p
def main():
    for i in range(int(input())):
        n,s = [int(item) for item in input().split()]
        a = [int(item) for item in input().split()]
        b = [i for i in a if i != -1]
        s , ones = s - sum(b),a.count(-1)         
        if s < 0:print(0)
        elif (s == 0 and ones == 0):print(niceness(a)%mod)
        elif (s > 0 and ones == 0):print(0)
        else:
            t = 0
            for seq in rule_asc(s,ones):
                if len(seq) == ones: t = (t + (((permcount(seq,ones))%mod)*(niceness(b+seq)%mod))%mod)%mod
            print(t)         
def __starting_point():main()
__starting_point()

mod = 10**9 + 7
def gcd(a,b): return b and gcd(b, a % b) or a

def fac50():
    f = [0]*51
    f[0] = 1
    f[1] = 1
    for i in range(1,51):
        f[i] = (f[i-1]*i)%mod
    return f

def gcd110():

    gc = [[0]*111 for i in range(111)]
    for i in range(111):
        for j in range(111):
            gc[i][j] = gcd(i,j)
    return gc

factorials = fac50()
gcds = gcd110()

def rule_asc(n,l):
    a = [0 for i in range(n + 1)]
    k = 1
    a[1] = n
    while k != 0:
        x = a[k - 1] + 1
        y = a[k] - 1
        k -= 1
        while x <= y and k < l - 1:
            a[k] = x
            y -= x
            k += 1
        a[k] = x + y
        yield a[:k + 1]

def niceness(s):
    t = 0
    for i in range(len(s)):
        for j in range(i+1,len(s)):
            t = (t + gcds[s[i]][s[j]])%mod
    return t


def permcount(s,c):
    f = [s.count(x) for x in set(s)]
    p = factorials[c]
    for e in f:
        p = (p*pow(factorials[e],mod-2,mod))%mod
    return p

def main():

    t  = int(input())

    for i in range(t):

        n,s = [int(item) for item in input().split()]
        a = [int(item) for item in input().split()]
        b = [i for i in a if i != -1]
        s -= sum(b)
        ones = a.count(-1)

        if s < 0:
            print(0)
        elif (s == 0 and ones == 0):
            print(niceness(a)%mod)
        elif (s > 0 and ones == 0):
            print(0)
        else:

            t = 0
            for seq in rule_asc(s,ones):
                if len(seq) == ones:
                    p = permcount(seq,ones)
                    t = (t + ((p%mod)*(niceness(b+seq)%mod))%mod)%mod

            print(t)

def __starting_point():
    main()

__starting_point()

import math

def niceness(a):
    nice=0
    for i in range(len(a)):
        for j in range(i+1,len(a)):
            nice+=math.gcd(a[i],a[j])
    return nice

def f(a, s):
    if -1 not in a:
        if s != 0: return ()
        return (tuple(a),)
    if s == 0:
        return ()
    idx = a.index(-1)
    ans = ()
    for i in range(1, s + 1):
        a[idx] = i
        ans += f(a, s - i)
        a[idx] = -1
    return ans

def __starting_point():
    t=int(input())
    numbers=[0]*50
    mod = 10**9 + 7
    for i in range(1,51):
        numbers[i-1]=i
    for i in range(t):
        n,s = map(int,input().split())
        a=list(map(int,input().split()))
        ans,ss=0,0
        for x in range(len(a)):
            if(a[x]!=-1):
                ss+=a[x]
        x=f(a,s-ss)
        for i in x:
            ans += niceness(i)
        print(ans % mod)
__starting_point()