Hint
Every shortest path has exactly a steps to the right and b down, in some order. You choose which of the a + b steps are "right": C(a + b, a). Use factorials and inverses modulo.
Solution (C++)
#include <iostream>
#include <vector>
using namespace std;
const long long MOD = 1000000007;
long long power(long long a, long long b) {
long long r = 1;
a %= MOD;
while (b > 0) {
if (b & 1) r = r * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return r;
}
int main() {
int a, b;
cin >> a >> b;
int n = a + b;
vector<long long> f(n + 1);
f[0] = 1;
for (int i = 1; i <= n; i++) f[i] = f[i - 1] * i % MOD;
// C(n, a) = n! / (a! * b!) -> we multiply by the inverse of the denominator
long long result = f[n] * power(f[a] * f[b] % MOD, MOD - 2) % MOD;
cout << result << endl;
return 0;
}