#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def IR(n):
    return [I() for _ in range(n)]
def LIR(n):
    return [LI() for _ in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    def gcd(a,b):
        if a == 0:
            return b
        return gcd(b%a,a)

    n,k = LI()
    a = [i%k for i in LI()]
    a = [i for i in a if gcd(i,k) > 1]
    dp = defaultdict(lambda : 0)
    dp[1] = 1
    for i in a:
        dp_ = list(dp.items())
        for j,v in dp_:
            if not v:
                continue
            ni = i*j
            if ni >= k:
                ni %= k
            dp[ni] += v
            if dp[ni] >= mod:
                dp[ni] -= mod
    print(dp[0]*pow(2,n-len(a),mod)%mod)
    return


if __name__ == "__main__":
    solve()