Problem: Vasily the bear has two favorite integers n and k and a pencil. Besides, he's got k jars with different water color paints. All jars are numbered in some manner from 1 to k, inclusive. The jar number i contains the paint of the i-th color. 

Initially the bear took a pencil and drew four segments on the coordinate plane. All of them end at point (0, 0). They begin at: (0, 2n), (0, - 2n), (2n, 0), ( - 2n, 0). Then for each i = 1, 2, ..., n, the bear drew two squares. The first square has the following vertex coordinates: (2i, 0), ( - 2i, 0), (0, - 2i), (0, 2i). The second square has the following vertex coordinates: ( - 2i - 1, - 2i - 1), ( - 2i - 1, 2i - 1), (2i - 1, - 2i - 1), (2i - 1, 2i - 1). After that, the bear drew another square: (1, 0), ( - 1, 0), (0, - 1), (0, 1). All points mentioned above form the set of points A.

<image>

The sample of the final picture at n = 0

<image>

The sample of the final picture at n = 2

The bear decided to paint the resulting picture in k moves. The i-th move consists of the following stages: 

  1. The bear chooses 3 distinct points in set А so that any pair of the chosen points has a segment on the picture between them. The chosen points and segments mark the area that mustn't contain any previously painted points. 
  2. The bear paints the area bounded by the chosen points and segments the i-th color. 



Note that after the k-th move some parts of the picture can stay unpainted.

The bear asked you to calculate, how many distinct ways there are to paint his picture. A way to paint the picture is a sequence of three-element sets of points he chose on each step. Two sequences are considered distinct if there is such number i (1 ≤ i ≤ k), that the i-th members of these sequences do not coincide as sets. As the sought number can be rather large, you only need to calculate the remainder after dividing it by number 1000000007 (109 + 7).

Input

The first line contains two integers n and k, separated by a space (0 ≤ n, k ≤ 200).

Output

Print exactly one integer — the answer to the problem modulo 1000000007 (109 + 7).

Examples

Input

0 0


Output

1


Input

0 1


Output

8


Input

0 2


Output

32


Input

1 1


Output

32

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;
import java.math.*;

public class Main {
    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        int N = cin.nextInt();
        int K = cin.nextInt();
        long ans = (new Solver(N, K)).solve();
        System.out.println(ans);
    }
}

class Solver {
    int N, K;
    long[][][] big, small; 
    static long[][] comb;
    static final int Mod = 1000000000 + 7;
    static {
        comb = new long[13][13];
        for (int i = 0; i <= 12; ++i) {
            for (int j = 0; j <= i; ++j) {
                if (j == 0 || j == i) {
                    comb[i][j] = 1;
                }
                else {
                    comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % Mod;
                }
            }
        }
    }
    Solver(int N, int K) {
        this.N = N;
        this.K = K;
        big = new long[N + 1][K + 1][1 << 4];
        small = new long[N + 1][K + 1][1 << 4];
        for (int i = 0; i <= N; ++i) {
            for (int j = 0; j <= K; ++j) {
                for (int k = 0; k < 16; ++k) {
                    big[i][j][k] = small[i][j][k] = -1;
                }
            }
        }
    }
    long solve() {
        long res = calcBig(N, K, 15);
        for (int i = K; i >= 1; --i) {
            res = res * i % Mod;
        }
        return res;
    }
    long calcBig(int size, int count, int mask) {
        if (count < 0) {
            return 0;
        }
        if (big[size][count][mask] != -1) {
            return big[size][count][mask];
        }
        long res = 0;
        if (mask == 15) {
            res += 2 * calcBig(0, count - 2, 0);
        }
        for (int i = 0; i < 4; ++i) {
            int j = (i + 1) & 3;
            if ((mask >> i & 1) == 1 && (mask >> j & 1) == 1) {
                int nxt = mask ^ (1 << i) ^ (1 << j);
                for (int k = nxt; ; k = (k - 1) & nxt) {
                    res += calcSmall(size, count - 1 - Integer.bitCount(k), nxt - k);
                    if (k == 0) {
                        break;
                    }
                }
            }
        }
        int nxt = mask;
        for (int k = nxt; ; k = (k - 1) & nxt) {
            res += calcSmall(size, count - Integer.bitCount(k), nxt - k);
            if (k == 0) {
                break;
            }
        }
        return big[size][count][mask] = res % Mod;
    }
    long calcSmall(int size, int count, int mask) {
        if (count < 0) {
            return 0;
        }
        if (small[size][count][mask] != -1) {
            return small[size][count][mask];
        }
        if (size == 0) {
            return count == 0 ? 1 : 0;
        }
        long res = 0;
        int maxCount = Integer.bitCount(mask) * 3;
        int pairCount = 0;
        for (int i = 0; i < 4; ++i) {
            int j = (i + 1) & 3;
            if ((mask >> i & 1) == 1 && (mask >> j & 1) == 1) {
                pairCount++;
            }
        }
        for (int i = 0; i <= pairCount; ++i) {
            for (int j = 0; j <= maxCount - i * 2; ++j) {
                res += calcBig(size - 1, count - i - j, mask) * comb[pairCount][i] % Mod * comb[maxCount - i * 2][j] % Mod;
            }
        }
        return small[size][count][mask] = res % Mod;
    }
}