import sys
sys.setrecursionlimit(10**7)
from functools import lru_cache

def attack(L1,R1,L2,R2):
    retu=[]
    if L1 and L2:
        retu.append(((L1+L2)%5,R2))
    if L1 and R2:
        retu.append((L2,(L1+R2)%5))
    if R1 and L2:
        retu.append(((R1+L2)%5,R2))
    if R1 and R2:
        retu.append((L2,(R1+R2)%5))
    return retu

def split(L,R):
    retu=[]
    for l in range(5):
        for r in range(5):
            if (l,r)==(0,0):
                continue
            if (l+r==L+R or l+r==(L+R)%5) and {l,r}!={L,R}:
                retu.append((l,r))
    return retu

def lose(L1,R1,L2,R2):
    if L2 and R2:
        return False
    s=L2+R2
    if (-s)%5 in (L1,R1):
        return True
    return False

@lru_cache(maxsize=None)
def solve(N,cnt,L1,R1,L2,R2):
    if (L1,R1)==(0,0):
        ans=0
    elif (L2,R2)==(0,0):
        ans=1
    elif cnt==K:
        ans=0
    else:
        ans=0
        if cnt%2!=N%2:
            if not (0,0) in attack(L2,R2,L1,R1):
                not_lose=False
                for L,R in split(L2,R2):
                    not_lose|=not lose(L1,R1,L,R)
                for L,R in attack(L2,R2,L1,R1):
                    not_lose|=not lose(L,R,L2,R2)

                for L,R in split(L2,R2):
                    if not_lose and lose(L1,R1,L,R):
                        continue
                    ans+=solve(N,cnt+1,L1,R1,L,R)
                for L,R in attack(L2,R2,L1,R1):
                    if not_lose and lose(L,R,L2,R2):
                        continue
                    ans+=solve(N,cnt+1,L,R,L2,R2)
        else:
            for L,R in split(L1,R1):
                ans+=solve(N,cnt+1,L,R,L2,R2)
            for L,R in attack(L1,R1,L2,R2):
                ans+=solve(N,cnt+1,L1,R1,L,R)
        ans%=mod
    return ans

N,K=map(int,input().split())
mod=10**9+7
L1,R1,L2,R2=map(int,input().split())
ans=solve(N,0,L1,R1,L2,R2)
print(ans)