/* *Author: Abhijit Kawale *IIT Delhi *HackerRank Profile: https://www.hackerrank.com/Abhijit_Kawale * */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef unsigned long long int ulli; typedef long long int lli; typedef vector vi; typedef vector > vii; typedef vector vlli; typedef vector vulli; typedef vector vb; typedef vector vs; typedef pair pib; typedef pair pii; typedef vector > vpii; #define checkbit(n,b) ((n>>b)&1) #define fi first #define se second #define in(a) cin>>a #define out(a) cout< debugger& operator , (const T& v) { cerr<= m ) s -= m; return s; } int MUL(int a, int b, int m = mod) { return (1LL * a * b % m); } int power(int a, int b, int m = mod) { int res = 1; while( b ) { if( b & 1 ) { res = 1LL * res * a % m; } a = 1LL * a * a % m; b /= 2; } return res; } lli nC2(lli x) { return ( x * ( x - 1 ) / 2 ); } void SieveOfEratosthenes(int n) { bool prime[n+1]; memset(prime, true, sizeof(prime)); prime[0] = false; prime[1] = false; for (int p=2; p*p<=n; p++) { if (prime[p] == true) { for (int i=p*2; i<=n; i += p) prime[i] = false; } } } int main(){ lli n;in(n);//int k;in(k); lli m;in(m); //vi v(n);inve(v); outl(n*m-1); return 0; }