import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } struct ModInt(int M_) { alias M = M_; int x; this(ModInt a) { x = a.x; } this(long a) { x = cast(int)(a % M); if (x < 0) x += M; } ref ModInt opAssign(long a) { return (this = ModInt(a)); } ref ModInt opOpAssign(string op)(ModInt a) { static if (op == "+") { x += a.x; if (x >= M) x -= M; } else static if (op == "-") { x -= a.x; if (x < 0) x += M; } else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); } else static assert(false); return this; } ref ModInt opOpAssign(string op)(long a) { static if (op == "^^") { ModInt t2 = this, te = ModInt(1); for (long e = a; e; e >>= 1) { if (e & 1) te *= t2; t2 *= t2; } x = cast(int)(te.x); return this; } else return mixin("this " ~ op ~ "= ModInt(a)"); } ModInt inv() const { int a = x, b = M, y = 1, z = 0, t; for (; ; ) { t = a / b; a -= t * b; if (a == 0) { assert(b == 1 || b == -1); return ModInt(b * z); } y -= t * z; t = b / a; b -= t * a; if (b == 0) { assert(a == 1 || a == -1); return ModInt(a * y); } z -= t * y; } } ModInt opUnary(string op)() const if (op == "-") { return ModInt(-x); } ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); } ModInt opBinaryRight(string op)(long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); } string toString() const { return x.to!string; } } enum MO = 10^^9 + 7; alias Mint = ModInt!MO; enum M = 6; void main() { int V; auto ids = new int[][][][](M, M, M, M); foreach (a; 0 .. M) foreach (b; 0 .. M) foreach (c; 0 .. M) foreach (d; 0 .. M) { ids[a][b][c][d] = V++; } auto winMoves = new int[][V]; auto moves = new int[][V]; foreach (a; 0 .. M) foreach (b; 0 .. M) foreach (c; 0 .. M) foreach (d; 0 .. M) { if (a + b == 0 || c + d == 0) { continue; } const u = ids[a][b][c][d]; void check(int aa, int bb, int cc, int dd) { const v = ids[aa][bb][cc][dd]; if (aa + bb == 0) { winMoves[u] ~= v; } else { moves[u] ~= v; } } // attack if (a != 0 && c != 0) check((c + a) % 5, d, a, b); if (b != 0 && c != 0) check((c + b) % 5, d, a, b); if (a != 0 && d != 0) check(c, (d + a) % 5, a, b); if (b != 0 && d != 0) check(c, (d + b) % 5, a, b); // split foreach (x; 0 .. M) foreach (y; 0 .. M) { if (a + b == x + y || a + b > 5 && (a + b) % 5 == (x + y) % 5) { if (a == y && b == x) continue; if (a == x && b == y) continue; if (x + y == 0) continue; check(c, d, x, y); } } assert(!winMoves[u].empty || !moves[u].empty); } auto takahashi = new int[][V]; foreach (u; 0 .. V) { if (winMoves[u].empty) { foreach (v; moves[u]) { if (winMoves[v].empty) { takahashi[u] ~= v; } } if (takahashi[u].empty) { debug { writeln("misery ", u); } takahashi[u] = moves[u].dup; } } } debug { foreach (a; 0 .. M) foreach (b; 0 .. M) foreach (c; 0 .. M) foreach (d; 0 .. M) { const u = ids[a][b][c][d]; if (!winMoves[u].empty) { writeln(a, " ", b, " ", c, " ", d, ": ", winMoves[u]); } } } try { for (; ; ) { const N = readInt(); const K = readInt(); int[2] L, R; foreach (i; 0 .. 2) { L[i] = readInt(); R[i] = readInt(); } Mint ans; auto dp = new Mint[][](K + 1, V); dp[0][ids[L[N]][R[N]][L[N ^ 1]][R[N ^ 1]]] = 1; foreach (k; 0 .. K) { const player = N ^ (k & 1); switch (player) { case 0: { foreach (u; 0 .. V) { foreach (v; winMoves[u]) { ans += dp[k][u]; } foreach (v; moves[u]) { dp[k + 1][v] += dp[k][u]; } } } break; case 1: { foreach (u; 0 .. V) { foreach (v; takahashi[u]) { dp[k + 1][v] += dp[k][u]; } } } break; default: assert(false); } } writeln(ans); } } catch (EOFException e) { } }