using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Security.Cryptography;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (d, l, r, k) = (c[0], c[1], c[2], c[3]);
        WriteLine(Encount(d, l, r, k));
    }
    static long Encount(int d, int l, int r, int k)
    {
        var ld = 0;
        var rd = 0;
        {
            var tmp = l;
            while (tmp > 1)
            {
                ++ld;
                tmp >>= 1;
            }
            tmp = r;
            while (tmp > 1)
            {
                ++rd;
                tmp >>= 1;
            }
        }
        if (ld + rd < k) return 0;
        if (Math.Abs(ld - rd) > k) return 0;
        if (Math.Abs(ld - rd) % 2 != k % 2) return 0;
        var pow = Math.Max(0, rd - ld) + Math.Max(0, (k - Math.Abs(ld - rd)) / 2 - 1);
        var mod = 1_000_000_007;
        var ans = 1L;
        for (var i = 0; i < d; ++i)
        {
            var count = 1 << i;
            if (i == rd)
            {
                ans = ans * (1 << pow) % mod;
                if (i == ld)
                {
                    ans = ans * count % mod;
                    for (var j = 1; j + 1 < count; ++j) ans = ans * j % mod;
                }
                else for (var j = 1; j < count; ++j) ans = ans * j % mod;
            }
            else
            {
                for (var j = 1; j <= count; ++j) ans = ans * j % mod;
            }
        }
        return ans;
    }
}