/// Msaa el 5ra
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 5e5 + 5, LG = 18, MOD = 1e9 + 7;
const long double PI = acos(-1);
const long double EPS = 1e-7;

struct Matrix {

    const static int D = 90;
    int a[D][D];

    Matrix(int val) {
        for (int i = 0; i < D; i++)
            for (int j = 0; j < D; j++)
                a[i][j] = val;
    }

    void clear() {
        memset(a, 0, sizeof a);
    }

    void initIdentity() {
        clear();
        for (int i = 0; i < D; i++)
            a[i][i] = 1;
    }

    int *operator[](int r) {
        return a[r];
    }

    const int *operator[](int r) const {
        return a[r];
    }

    friend Matrix operator*(const Matrix &a, const Matrix &b) {
        Matrix ret(0);
        for (int k = 0; k < D; k++)
            for (int i = 0; i < D; i++)
                if (a[i][k])
                    for (int j = 0; j < D; j++)
                        ret[i][j] = (ret[i][j] + 1ll * a[i][k] * b[k][j]) % MOD;
        return ret;
    }

};

Matrix raiseMatrix(Matrix trans, ll k) {
    Matrix res(0);
    res.initIdentity();
    for (; k; k >>= 1, trans = trans * trans)
        if (k & 1)
            res = res * trans;
    return res;
}

void doWork() {

    ll a, b;
    cin >> a >> b;
    if (a == 1) {
        cout << (b < 10) << '\n';
        return;
    }
    if (a == 2) {
        if (b < 100 && b >= 10 && (b % 10) != (b / 10)) {
            cout << 1 << '\n';
        } else {
            cout << 0 << '\n';
        }
        return;
    }
    Matrix mat(0);
    f(i, 0, 9)f(x, 0, 10)f(y, 0, 10) {
                mat[i * 10 + x][((i * 10 + x) % 9) * 10 + y] += (x != y);
            }
    mat = raiseMatrix(mat, a - 2);
    int ans = 0;
    f(i, 0, 90) {
        f(j, 0, 100) {
            if (j % 10 == j / 10)continue;
            if (j / 10 == i % 10)continue;
            if ((i * 100 + j) % 225 == b) {
                ans = (ans + mat[0][i]) % MOD;
            }
        }
    }
    cout << ans << '\n';

}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
}