from math import factorial
d, l, r, k = map(int, input().split())
mod = 10**9 + 7
ans = 1
depth1, depth2 = -1, -1

for depth in range(d):
    i_l, i_r = 2**depth, 2**(depth+1)-1
    nodes = 2**depth
    if i_l <= l <= i_r:
        depth1 = depth
        nodes -= 1
    if i_l <= r <= i_r:
        depth2 = depth
        nodes -= 1

    ans = (ans * factorial(nodes)) % mod

if depth1 != depth2:
    if abs(depth1 - depth2) != k:
        ans = 0
    else:
        ans = ans * 2**depth1 * 2**depth2 % mod
else:
    if k % 2 == 1 or (d-1)*2 < k:
        ans = 0
    else:
        nodes = 2 ** depth1
        unit = 2 ** (k//2)
        n = nodes // unit
        ans = ans * (pow(unit//2, 2, mod) * n) * 2 % mod

print(ans % mod)