import bisect
import copy
import decimal
import fractions
import functools
import heapq
import itertools
import math
import random
import sys
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

def XOR_Basis(lst):
    xor_basis=[]
    triangulation=[]
    for x in lst:
        xx=x
        for xb in triangulation:
            xx=min(xx,xx^xb)
        if xx:
            xor_basis.append(x)
            for i in range(len(triangulation)):
                if triangulation[i]^xx<triangulation[i]:
                    triangulation[i]^=xx
            triangulation.append(xx)
    return xor_basis,triangulation

N,M,X=map(int,readline().split())
A=list(map(int,readline().split()))
for bit in range(30,M+30):
    t,l,r=map(int,readline().split())
    for i in range(l-1,r):
        A[i]|=1<<bit
    if t==1:
        X|=1<<bit
_,tria=XOR_Basis(A)
for a in tria:
    if X^a<X:
        X^=a
mod=10**9+7
if X==0:
    ans=pow(2,N-len(tria),mod)
else:
    ans=0
print(ans)