#include<iostream>
#include <bits/stdc++.h>

#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 100 + 5, mod = 1e9 + 7;

struct Matrix {
    int n;
    int val;
    vector<vector<int> > a;

    Matrix(int _n, int _val) {
        n = _n, val = _val;
        a.resize(n, vector<int>(n, 0));
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                a[i][j] = (i == j ? val : 0);
    }

    Matrix operator*(const Matrix &other) {
        Matrix res(n, 0);
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                for (int k = 0; k < n; k++)
                    res.a[i][j] = (1LL * res.a[i][j] + 1LL * a[i][k] * other.a[k][j]) % mod;
        return res;
    }
};

Matrix power(Matrix a, ll p) {
    Matrix res(a.n, 1), temp = a;
    while (p) {
        if (p & 1)
            res = res * temp;
        temp = temp * temp;
        p >>= 1;
    }
    return res;
}

void doWork() {

    ll a, b;
    cin >> a >> b;

    if (a <= 3) {
        int ans = 0;
        for (int i = 1; i < 1000; i++) {
            int len = 0, temp = i, last = -1;
            while (temp) {
                len++;
                if (temp % 10 == last) {
                    len = 1e5;
                    break;
                }
                last = temp % 10;
                temp /= 10;
            }
            if (len == a && i % 225 == b) {
                ans++;
            }
        }
        cout << ans;
        return;
    }
    Matrix mat(90, 0);
    for (int rem = 0; rem < 9; rem++) {
        for (int last = 0; last < 10; last++) {
            int from = rem * 10 + last;
            for (int cur = 0; cur < 10; cur++) {
                if (cur == last)continue;

                int to = ((rem * 10 + cur) % 9) * 10 + cur;
                // cout << from << " " << to << "\n";
                mat.a[from][to]++;
            }
        }
    }
    // return;
    mat = power(mat, a - 2);

    int ans = 0;
    for (int to = 0; to < 90; to++) {
        int rem = to / 10;
        int last = to % 10;

        for (int cur = 0; cur < 100; cur++) {
            if (cur % 10 == (cur / 10) % 10 || (cur / 10) % 10 == last)continue;

            if ((rem * 100 + cur) % 225 == b) {
                ans = (ans + mat.a[0][to]) % mod;
            }
        }
    }
    cout << ans;
}

int main() {
    IO
    int t = 1;
    //cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}