#include<bits/stdc++.h>
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int mod=1e9+7;
inline int ksm(int x,int y=mod-2){
    int sum=1;
    while(y){
        if(y&1) sum=1ll*sum*x%mod;
        y=y/2;x=1ll*x*x%mod;
    }
    return sum;
}
int ans;
const int inv2=ksm(2);
int a,b,nx,ny,mx,my;
inline int getsum(int l,int r){
    l=max(l,0),r=max(r,0);
    if(l>r || l<0 || r<0) return 0;
    return 1ll*(l+r)%mod*(r-l+1)%mod*inv2%mod;
}
inline int getans(int l,int r){
    return 1ll*getsum(1,l)*getsum(1,r)%mod;
}
inline void add(int &x,int y){x+=y;if(x>=mod) x-=mod;}
inline void work(){
    b=read();nx=read();mx=read();ny=read();my=read();
    int ans=0;
    add(ans,1ll*(mx-nx)*(my-ny)%mod*a%mod*b%mod);
    add(ans,1ll*getsum(1,a)*getsum(1,b)%mod);
    add(ans,mod-1ll*getsum(a-mx+1,a-nx)*getsum(b-my+1,b-ny)%mod);
    writeln(ans);
}
inline void init(){
    while(cin>>a) work();
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}