UVA - 10970 Big Chocolate

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<stack>
#include<algorithm>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int maxn = 100000 + 7, INF = 0x3f3f3f3f, mod = 1e9+7;
int p, n, m, x;
char s[maxn], t[maxn];

int main() {
    while(scanf("%d%d", &m, &n) != EOF ) {
        cout << m*n-1 << endl;
    }

    return 0;
}