func_code_string: #include <bits/stdc++.h>   using namespace std;   const int maxn = 505;   const int mod = 1e9 + 7;   long long int dp[1005][1005] = {0};   int main() {     long long int n, m, k;     cin >> n >> m >> k;     if (2 * k > n - 1 || 2 * k > m - 1)       cout << 0 << endl;     else {       dp[0][0] = 1;       for (int i = 1; i <= 1000; i++) {         dp[i][0] = 1;         dp[i][i] = 1;         for (int j = 1; j <= i; j++) {           dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1]) % mod;         }       }       cout << ((dp[n - 1][2 * k] % mod) * (dp[m - 1][2 * k] % mod)) % mod << endl;     }   }   