#include<bits/stdc++.h>

using namespace std;
#define ll long long
const int mod = 1000000007;

int qpow(ll n)
{
    ll tmp = 1;
    ll a = 10;
    while(n)
    {
        if(n&1) tmp = tmp*a%mod;
        a = a*a%mod;
        n /= 2;
    }
    return tmp;
}

int main()
{
    ll n, k;
    cin >> n >> k;
    if(k > 8 || k < -9) {cout << 0 << endl; return 0;}
    int cnt;
    if(k < 0) cnt = 10 + k;
    else cnt = 9 - k;
   // cout << cnt << endl;
    cnt = cnt*qpow(n-2)%mod;
    cout << cnt << endl;
    return 0;
}