import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int det(int a, int b, int c, int d) {
  return abs(a * d - b * c);
}

void main() {
  try {
    for (; ; ) {
      const H = readInt;
      const W = readInt;
      const K = readInt;
      
      auto fs = new BigInt[K + 1];
      foreach (a; 0 .. H) foreach (b; 0 .. W) {
        int g;
        g = gcd(g, det(H, 0, 0, W));
        g = gcd(g, det(H, 0, a, b));
        g = gcd(g, det(0, W, a, b));
        debug {
          writeln(a, " ", b, ": ", g);
        }
        foreach (k; 0 .. K + 1) {
          fs[k] += BigInt(k)^^g;
        }
      }
      foreach (k; 0 .. K + 1) {
        assert(fs[k] % (H * W) == 0);
        fs[k] /= (H * W);
      }
      debug {
        writeln("fs = ", fs);
      }
      
      BigInt ans;
      foreach (k; 0 .. K + 1) {
        long bn = 1;
        foreach (i; 0 .. k) {
          bn *= (K - i);
          bn /= (1 + i);
        }
        ans += (-1)^^((K - k) & 1) * bn * fs[k];
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}