#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}


template<typename T,T MOD = 1000000007>
struct Mint{
  static constexpr T mod = MOD;
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(long long k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }

  static Mint add_identity(){return Mint(0);}
  static Mint mul_identity(){return Mint(1);}

  Mint inv(){return pow(MOD-2);}

  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}

  Mint operator+(Mint a) const{return Mint(v)+=a;}
  Mint operator-(Mint a) const{return Mint(v)-=a;}
  Mint operator*(Mint a) const{return Mint(v)*=a;}
  Mint operator/(Mint a) const{return Mint(v)/=a;}

  Mint operator-() const{return v?Mint(MOD-v):Mint(v);}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}
  bool operator <(const Mint a)const{return v <a.v;}

  static Mint comb(long long n,int k){
    Mint num(1),dom(1);
    for(int i=0;i<k;i++){
      num*=Mint(n-i);
      dom*=Mint(i+1);
    }
    return num/dom;
  }
};
template<typename T,T MOD> constexpr T Mint<T, MOD>::mod;
template<typename T,T MOD>
ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}

//INSERT ABOVE HERE
using M = Mint<int>;
const int MAX = 20002;
M dp[5*5*5*5][MAX]={};
int win[5*5*5*5]={};

int calc(int a,int b,int c,int d){
  return (((a*5+b)*5+c)*5+d);
}

using P = pair<int, int>;
vector<P> vp[5*5];
void init(){
  for(int j=0;j<5*5*5*5;j++){
    int a=(j/125)%5;
    int b=(j/25)%5;
    int c=(j/5)%5;
    int d=(j/1)%5;

    if(a==0&&b==0) continue;
    if(c==0&&d==0) continue;

    for(int k=0;k<4;k++){
      int nc=c,nd=d;
      int add=(~k&1?a:b);
      if(add==0||(k/2?nc:nd)==0) continue;
      (k/2?nc:nd)+=add;
      (k/2?nc:nd)%=5;
      if(nc==0&&nd==0) win[j]=1;
    }
  }

  for(int j=0;j<5*5*5*5;j++){
    int a=(j/125)%5;
    int b=(j/25)%5;
    int c=(j/5)%5;
    int d=(j/1)%5;

    if(a==0&&b==0) continue;
    if(c==0&&d==0) continue;

    if((a+b)!=(c+d)&&(a+b)%5!=c+d) continue;
    if(P(a,b)==P(c,d)) continue;
    if(P(a,b)==P(d,c)) continue;

    vp[a*5+b].emplace_back(c,d);
    //cout<<a<<" "<<b<<":"<<c<<" "<<d<<endl;
  }
}


signed main(){
  init();

  int n,k;
  cin>>n>>k;
  int l1,r1,l2,r2;
  cin>>l1>>r1>>l2>>r2;

  dp[calc(l1,r1,l2,r2)][0]=1;

  M ans{0};
  for(int i=0;i<k;i++){
    for(int j=0;j<5*5*5*5;j++){
      int a=(j/125)%5;
      int b=(j/25)%5;
      int c=(j/5)%5;
      int d=(j/1)%5;
      //if(dp[j][i].v) cout<<a<<" "<<b<<" "<<c<<" "<<d<<":"<<dp[j][i]<<endl;

      if(a==0&&b==0) continue;
      if(c==0&&d==0) continue;

      if(~(i^n)&1){
        // First
        for(int k=0;k<4;k++){
          int nc=c,nd=d;
          int add=(~k&1?a:b);
          if(add==0||(k/2?nc:nd)==0) continue;
          (k/2?nc:nd)+=add;
          (k/2?nc:nd)%=5;
          dp[calc(a,b,nc,nd)][i+1]+=dp[j][i];
          if(nc==0&&nd==0) ans+=dp[j][i];
        }
        for(auto p:vp[a*5+b]){
          int na=p.first,nb=p.second;
          dp[calc(na,nb,c,d)][i+1]+=dp[j][i];
        }
      }else{
        // Second

        // Win
        if(win[calc(c,d,a,b)]) continue;

        int cnt=0;
        for(int k=0;k<4;k++){
          int na=a,nb=b;
          int add=(~k&1?c:d);
          if(add==0||(k/2?na:nb)==0) continue;
          (k/2?na:nb)+=add;
          (k/2?na:nb)%=5;
          if(!win[calc(na,nb,c,d)]) cnt++;
        }

        for(auto p:vp[c*5+d]){
          int nc=p.first,nd=p.second;
          if(!win[calc(a,b,nc,nd)]) cnt++;
        }

        for(int k=0;k<4;k++){
          int na=a,nb=b;
          int add=(~k&1?c:d);
          if(add==0||(k/2?na:nb)==0) continue;
          (k/2?na:nb)+=add;
          (k/2?na:nb)%=5;
          if(cnt&&win[calc(na,nb,c,d)]) continue;
          dp[calc(na,nb,c,d)][i+1]+=dp[j][i];
        }

        for(auto p:vp[c*5+d]){
          int nc=p.first,nd=p.second;
          if(cnt&&win[calc(a,b,nc,nd)]) continue;
          dp[calc(a,b,nc,nd)][i+1]+=dp[j][i];
        }
      }
    }
  }
  cout<<ans<<endl;
  return 0;
}