int modInverse(int b, int m) {
  int x, y;
  int gcd = extendedEuclid(b, m, x, y);
  if (gcd != 1) return -1;

  return x % m;
}