import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# 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 = 10**16
# md = 998244353
md = 10**9+7

def nHr(hn, hr):
    return nCr(hn+hr-1, hr-1)

def nPr(com_n, com_r):
    if com_r < 0: return 0
    if com_n < com_r: return 0
    return fac[com_n]*ifac[com_n-com_r]%md

def nCr(com_n, com_r):
    if com_r < 0: return 0
    if com_n < com_r: return 0
    return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md

# 準備
n_max = (1 << 20)+5
fac = [1]
for i in range(1, n_max+1): fac.append(fac[-1]*i%md)
ifac = [1]*(n_max+1)
ifac[n_max] = pow(fac[n_max], md-2, md)
for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md

d, l, r, k = LI()
dl = l.bit_length()-1
dr = r.bit_length()-1
if (dl+dr-k) & 1:
    print(0)
    exit()
da = (dl+dr-k)//2
if da < 0 or da > dl:
    print(0)
    exit()
# print(dl, dr, da)

ans = 1
w = 1
for i in range(d):
    if i == dr:
        if dl == dr:
            ans *= w*(1 << dr-da-1)*nPr(w-2, w-2)
        elif da == dl:
            ans *= (1 << dr-da)*nPr(w-1, w-1)
        else:
            ans *= (1 << dr-da-1)*nPr(w-1, w-1)
    else:
        ans *= nPr(w, w)
    ans %= md
    w <<= 1

print(ans)