import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

n, m, x = LI()
aa = LI()
lr = LLI(m)

ss = [0]*(30+m)
for a in aa+[x]:
    for i in range(30):
        ss[i] <<= 1
        ss[i] |= a & 1
        a >>= 1

for i, (t, l, r) in enumerate(lr, 30):
    l -= 1
    ss[i] = (1 << r-l)-1 << n-r+1
    ss[i] |= t

btos = {}

for s in ss:
    if len(btos) == 30+m: break
    while s:
        b = s.bit_length()
        if b in btos:
            s ^= btos[b]
        else:
            btos[b] = s
            break

if 1 in btos:
    print(0)
else:
    print(pow(2, n-len(btos), md))