#include <bits/stdc++.h>
#define lc (o<<1)
#define rc ((o<<1)|1)
#define PB push_back
#define MK make_pair
using namespace std;
#define DebugP(x) cout << "Line" << __LINE__ << " " << #x << "=" << x << endl

const int maxn = 2e5 + 5;
const int modu = 1e9 + 7; // 1e9 + 7
const int inf = 0x3f3f3f3f;
const double eps = 1e-5;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

typedef long long LL;

void read(LL &x)
{
    x=0;int f=0;char ch=getchar();
    while(ch<'0'||ch>'9')  {f|=(ch=='-');ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
    x=f?-x:x;
    return;
}

void read(int &x) { LL y; read(y); x = (int)y; }
void read(char &ch) { char s[3]; scanf("%s", s); ch = s[0]; }
void read(char *s) { scanf("%s", s); }
template<class T, class ...U> void read(T &x, U& ... u) { read(x); read(u...); }

char N[maxn];
int k, n;
LL f[maxn][16][2];

int num(char ch) {
    if ('0' <= ch && ch <= '9') return ch - '0';
    return ch - 'A' + 10;
}

int main() {
    // freopen("my.txt", "w", stdout);
    read(N, k);
    n = strlen(N);
    if (n < k) printf("0\n");
    else {
        int d = num(N[0]), s = 0;
        memset(f, 0, sizeof(f));
        f[0][1][0] = d-1;
        f[0][1][1] = 1;
        f[0][0][0] = 1;
        s = (1<<d);
        for (int i = 0; i < n-1; ++i) {
            d = num(N[i+1]);
            f[i+1][1][0] = 15;
            for (int j = 1; j <= k; ++j) {
                f[i+1][j][0] = (f[i+1][j][0] + f[i][j][0]*j) % modu;
                for (int l = 0; l < d; ++l) if ((s&(1<<l)))
                    f[i+1][j][0] = (f[i+1][j][0] + f[i][j][1]) % modu;
                if (s&(1<<d))
                    f[i+1][j][1] = (f[i+1][j][1] + f[i][j][1]) % modu;
                if (j+1 <= k) {
                    f[i+1][j+1][0] = (f[i+1][j+1][0] + f[i][j][0]*(16-j)) % modu;
                    for (int l = 0; l < d; ++l) if ((s&(1<<l)) == 0)
                        f[i+1][j+1][0] = (f[i+1][j+1][0] + f[i][j][1]) % modu;
                    if ((s&(1<<d)) == 0)
                        f[i+1][j+1][1] = (f[i+1][j+1][1] + f[i][j][1]) % modu;
                }
            }
            s |= (1<<d);
        }
        printf("%lld\n", (f[n-1][k][0] + f[n-1][k][1])%modu);
    }
	return 0;
}
#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for(int i=0; i<(n); ++i)
#define RREP(i, n) for(int i=(n);i>=0;--i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, b) for(int i=(a);i>=(b);--i)


#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()

#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  REP(i, SZ(v)) {
    if (i) os << " ";
    os << v[i];
  }
  return os;
}

template <class T>
void debug(const vector<T> &v) {
  cout << "[";
  REP(i, SZ(v)) {
    if(i) cout << ", ";
    cout << v[i];
  }
  cout << "]" << endl;
}

template<class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << p.first << " " << p.second;
}

template <class T, class U>
void debug(const pair<T, U> &p) {
  cout << "(" << p.first << " " << p.second << ")" << endl;
}

template<class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;

const ll MOD = 1e9 + 7;
const ll MOD998 = 998244353;
const int INF = INT_MAX;
const ll LINF = LLONG_MAX;
const int inf = INT_MIN;
const ll linf = LLONG_MIN;
const ld eps = 1e-9;


template<int m>
struct mint {
  int x;

  mint(ll x = 0) : x(((x % m) + m) % m) {}

  mint operator-() const { return x ? m - x : 0; }

  mint &operator+=(mint r) {
    if ((x += r.x) >= m) x -= m;
    return *this;
  }

  mint &operator-=(mint r) {
    if ((x -= r.x) < 0) x += m;
    return *this;
  }

  mint &operator*=(mint r) {
    x = ((ll) x * r.x) % m;
    return *this;
  }

  mint inv() const { return pow(m - 2); }

  mint &operator/=(mint r) { return *this *= r.inv(); }

  friend mint operator+(mint l, mint r) { return l += r; }

  friend mint operator-(mint l, mint r) { return l -= r; }

  friend mint operator*(mint l, mint r) { return l *= r; }

  friend mint operator/(mint l, mint r) { return l /= r; }

  mint pow(ll n) const {
    mint ret = 1, tmp = *this;
    while (n) {
      if (n & 1) ret *= tmp;
      tmp *= tmp, n >>= 1;
    }
    return ret;
  }

  friend bool operator==(mint l, mint r) { return l.x == r.x; }

  friend bool operator!=(mint l, mint r) { return l.x != r.x; }

  friend ostream &operator<<(ostream &os, mint a) {
    return os << a.x;
  }

  friend istream &operator>>(istream &is, mint &a) {
    ll x;
    is >> x;
    a = x;
    return is;
  }
};

using Int = mint<MOD>;

ll modpow(ll x, ll n, ll m) {
  ll res = 1;
  while(n > 0) {
    if(n & 1) {
      res *= x;
      res %= m;
    }
    x *= x;
    x %= m;
    n /= 2;
  }
  return res;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);

  ll a, b, c; cin >> a >> b >> c;
  vll v = {a%10};
  ll now = a%10;
  while(1) {
    now *= a%10;
    now %= 10;
    if(now == a%10) break;
    v.push_back(now);
  }

  ll val = modpow(b, c, SZ(v));

  cout << v[(val+SZ(v)-1)%SZ(v)] << endl;


  return 0;
}


