#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;

typedef long long ll;

ll mod_pow(ll x, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    ll p, k, MOD = 1e9 + 7;
    cin >> p >> k;
    ll x = (mod_pow(10, p - 1, MOD) - 1 + MOD) % MOD;
    ll y = (x * mod_pow(p, MOD - 2, MOD)) % MOD;
    if (k == 0) y = (y + 1) % MOD; 
    cout << y << "\n";
}