#include <bits/stdc++.h>

using namespace std;
int input(){
    int res = 0; char c = ' ';
    while (c < '0') c = getchar();
    while (c >= '0') res = res * 10 + (c - '0'), c = getchar();
    return res;
}
typedef long long ll;
const int N = 301;

ll f[N][N][N], cnt[N][N][N];
int main(){
    int x = input(), y = input(), z = input(); ll ans = 0;
    cnt[0][0][0] = 1;
    for (int i = 0; i <= x; ++ i)
        for (int j = 0; j <= y; ++ j)
            for (int k = 0; k <= z; ++ k){
                if (i){
                    f[i][j][k] += f[i - 1][j][k] * 10 + 4 * cnt[i - 1][j][k];
                    cnt[i][j][k] += cnt[i - 1][j][k];
                }
                if (j){
                    f[i][j][k] += f[i][j - 1][k] * 10 + 5 * cnt[i][j - 1][k];
                    cnt[i][j][k] += cnt[i][j - 1][k];
                }
                if (k){
                    f[i][j][k] += f[i][j][k - 1] * 10 + 6 * cnt[i][j][k - 1];
                    cnt[i][j][k] += cnt[i][j][k - 1];
                }
                ans += f[i][j][k];
            }
    cout << ans;
}