#include <bits/stdc++.h>
using namespace std;
long long int mod1 = 1e9 + 7;
int mod2 = 998244353;
long long int inf = 1e9;
long long int maxxy = 1e6 + 9;
const double PI = 3.141592653589793238;
long long int add_self(long long int a, long long int b) {
  a += b;
  if (a >= mod1) a -= mod1;
  return a;
}
long long int sub_self(long long int a, long long int b) {
  a -= b;
  if (a < 0) a += mod1;
  return a;
}
unsigned long long int sumcons(unsigned long long int a,
                               unsigned long long int b) {
  if (a == 0) {
    return (b * (b - 1)) / 2;
  } else {
    unsigned long long int zzz = (b * (b + 1)) / 2;
    zzz += ((a - 1) * b);
    return zzz;
  }
}
long long int power(long long int x, long long int y, long long int pp) {
  long long int res = 1;
  x = x % pp;
  while (y > 0) {
    if (y & 1) res = (res * x) % pp;
    y = y >> 1;
    x = (x * x) % pp;
  }
  return res;
}
long long int modInverse(long long int n, long long int pp) {
  return power(n, pp - 2, pp);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int a, b, n;
  cin >> a >> b >> n;
  vector<long long int> fact(n + 1);
  fact[0] = 1;
  fact[1] = 1;
  for (int j = 2; j <= n; ++j) {
    (fact[j] = j * fact[j - 1]) %= mod1;
  }
  long long int ans = 0;
  for (int i = 0; i <= n; ++i) {
    long long int sum = i * a + (n - i) * b;
    long long int z = 1;
    while (sum != 0) {
      long long int x = sum % 10;
      if (x != a && x != b) {
        z = 0;
        break;
      }
      sum /= 10;
    }
    if (z) {
      long long int num = fact[n];
      long long int dem = fact[i] * fact[n - i];
      dem %= mod1;
      long long int add = num * (modInverse(dem, mod1) % mod1);
      add %= mod1;
      (ans += add) %= mod1;
    }
  }
  cout << ans << "\n";
  return 0;
}
