import sys
import math
import threading

def main():
    import sys
    MOD = 998244353
    t = int(sys.stdin.readline())
    for _ in range(t):
        line = ''
        while line.strip() == '':
            line = sys.stdin.readline()
        n,m,v = map(int,line.strip().split())
        a = []
        while len(a) < n:
            a += list(map(int, sys.stdin.readline().strip().split()))
        # For each j, compute C_j = set of i where a_i >= a_j -m
        C = []
        for j in range(n):
            req = a[j] - m
            if req <0:
                req = -math.inf
            Cj = 0
            for i in range(n):
                if a[i] >= a[j] - m:
                    Cj |= (1 << i)
            C.append(Cj)
        # Now, need to count subsets S where for all j not in S, S intersects C_j !=0
        # If n >20, it's impossible to iterate. Hence, n<=20
        if n >20:
            print(0)
            continue
        total =0
        for S in range(1,1<<n):
            valid = True
            for j in range(n):
                if not (S & (1 << j)):
                    if (S & C[j]) ==0:
                        valid = False
                        break
            if valid:
                total = (total +1)%MOD
        print(total%MOD)

threading.Thread(target=main,).start()