Problem:
 ﻿Score: 100 points    Problem Statement  There is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)   What is the area of this yard excluding the roads? Find it.      Note  It can be proved that the positions of the roads do not affect the area.      Constraints   A is an integer between 2 and 100 (inclusive).  B is an integer between 2 and 100 (inclusive).         Input  Input is given from Standard Input in the following format:  A  B       Output  Print the area of this yard excluding the roads (in square yards).        Sample Input 1 2 2      Sample Output 1 1  In this case, the area is 1 square yard.       Sample Input 2 5 7      Sample Output 2 24  In this case, the area is 24 square yards.

Solution (Python):
A, B = map(int,input().split())
print((A-1)*(B-1))

Solution (Python):
from sys import stdin
input = stdin.readline



def VI(N, init=0):
  return [init for _ in range(N)]
def VVI(N, M, init=0):
  return [[init for _ in range(M)] for _ in range(N)]

def VD(N, init=0.0):
  return [init for _ in range(N)]
def VVD(N, M, init=0.0):
  return [[init for _ in range(M)] for _ in range(N)]

a, b = map(int, input().rstrip().split())

print((a-1)*(b-1))

Solution (Python):
X, Y = map(int, input().split())
print((X - 1) * (Y - 1))

Solution (Python):
A,B = map(int,input().split())
print(A*B-(A+B-1))

Solution (Python):

a, b = map(int, input().split())
print(a*b - a - b + 1)

Solution (Python):
x, y = map(int, input().split())
print(x * y - x - y + 1)

Solution (Python):
a, b = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
A,B=map(int,input().split())
print(A*B-(A+B)+1)

Solution (Python):
a,b=map(int,input().split())
print(a*b-a-b+1)

Solution (Python):
a, b = map(int, input().split())

ans = (a - 1) * (b - 1)
print(ans)

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a,b = map(int,input().split())
x = a*b
x -= a+b-1
print(x)

Solution (Python):
a,b = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
A, B = map(int, input().split())

print((A-1)*(B-1))

Solution (Python):
a,b = map(int,input().split())
print((a-1)*(b-1))

Solution (Python):


A, B = map(int, input().split())
print((A - 1) * (B - 1))

Solution (Python):
a,b = map(int,input().split())
print(a*b-a-b+1)

Solution (Python):
a,b = map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
n, m = map(int, input().split())
print((n-1)*(m-1))

Solution (Python):
length, width = map(int, input().split())
print((length-1)*(width-1))

Solution (Python):
A, B = map(int, input().split())
print((A-1)*(B-1))

Solution (Python):

import sys
import numpy as np

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A = np.array(lr())
A -= 1
answer = A.cumprod()[-1]
print(answer)

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18


a, b = Is()
print((a-1)*(b-1))

Solution (Python):
A, B = map(int, input().split())
print((A-1)*(B-1))

Solution (Python):
a,b = map(int, input().split())
print((a-1) * (b-1))

Solution (Python):
a, b = map(int,input().split())
print((a*b)-(a+b-1))

Solution (Python):
a,b=map(int,input().split())

print((a-1)*(b-1))

Solution (Python):
a, b = list(map(int, input().split()))
print((a - 1) * (b - 1))

Solution (Python):
A, B = map(int, input(). split())
print((A-1)*(B-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
A, B = map(int, input().split())

ans = A * B - A - B + 1
print(ans)

Solution (Python):
A,B=map(int,input().split())
print((A-1)*(B-1))

Solution (Python):

a,b=map(int,input().split())



ans=a*b-(a+b)+1
print(ans)

Solution (Python):
a,b = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
s = list(map(int,input().split()))
print(s[0]*s[1] -(s[0]+s[1]-1))

Solution (Python):






def main():
    a, b = map(int, input().split())
    return (a-1)*(b-1)


print(main())

Solution (Python):
A,B=map(int,input().split())
print(A*B-(B+A-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
n, m = map(int, input().split())
print((n - 1) * (m - 1))

Solution (Python):

"""
Created on Wed May 13 15:52:03 2020

@author: shinba
"""

a,b = map(int,input().split())

print((a-1)*(b-1))

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





A,B = inputIL()

print((A-1)*(B-1))

Solution (Python):
a, b = map(int, input().split())
print((a - 1) * (b - 1))

Solution (Python):
A, B = map(int, input().split())

print( (A-1)*(B-1) )

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
import sys
import math
import bisect

def main():
    a, b = map(int, input().split())
    ans = a * b - a - b + 1
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
def main():
    a,b = list(map(int, input().split()))
    print(a*b - (a+b-1))

if __name__ == '__main__':
    main()

Solution (Python):
a,b = map(int,input().split())
print(a * b - (a + b - 1))

Solution (Python):
A, B = map(int, input().split(' '))

print(A * B - A - B + 1)

Solution (Python):
A,B = map(int, input().split())
print(A*B-A-B+1)

Solution (Python):
a,b=map(int,input().split())
print(~-a*~-b)

Solution (Python):
A, B = map(int, input().split())

print((A-1) * (B-1))

Solution (Python):
a,b=map(int,input().split())
print(a*b-a-b+1)

Solution (Python):
a, b = map(int, input().split())
print(a * b - a - b + 1)

Solution (Python):
A,B = map(int,input().split())
print((A - 1) * (B - 1))

Solution (Python):
H,W=list(map(int,input().split()))
print((H-1)*(W-1))

Solution (Python):
def ABC_106_A():
    A,B = map(int, input().split())
    print((A-1)*(B-1))

if __name__ == '__main__':

    ABC_106_A()

Solution (Python):

def main():
    A,B  = map(int, input().split())
    print((A-1)*(B-1))

if __name__ == '__main__':
    main()

Solution (Python):
A,B=map(int,input().split())
print((A-1)*(B-1))

Solution (Python):
a, b = [int(x) for x in input().split()]
print(a * b - (a + b - 1))

Solution (Python):

import sys


def solve(A: int, B: int):
    return (A - 1) * (B - 1)



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    print(solve(A, B))

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    
    main()

Solution (Python):
a, b = map(int, input().split())
print((a - 1) * (b - 1))

Solution (Python):
A,B = map(int,input().split())
print((A-1)*(B-1))

Solution (Python):
A,B = map(int, input().split())
print((A-1)*(B-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a, b = map(int, input().split())
print((a-1) * (b-1))

Solution (Python):
x,y=(map(int,input().split()))
print((x-1)*(y-1))

Solution (Python):
A, B = map(int, input().split())
print((A-1) * (B-1))

Solution (Python):
import sys
import math

a, b= map(int, input().split())
print(a*b-a-b+1)

Solution (Python):
a, b = map(int, input().split())
print((a - 1) * (b - 1))

Solution (Python):
a,b = map(int,input().split())

ab = a*b
arbr = a+b

print(ab-arbr+1)

Solution (Python):
A, B = map(int, input().split())
print((A-1)*(B-1))

Solution (Python):
MOD = 10 ** 9 + 7
INF = 10 ** 11
import sys
sys.setrecursionlimit(100000000)

def main():
    A,B = map(int,input().split())
    print((A - 1)*(B - 1))
if __name__ == '__main__':
    main()

Solution (Python):


import sys






















def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b = mi()
    print((a - 1) * (b - 1))


if __name__ == "__main__":
    main()

Solution (Python):
a,b=map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
def main():
    a, b = map(int, input().split())
    ans = solve(a, b)
    print(ans)


def solve(a, b):
    ans = (a - 1) * (b - 1)
    return ans


if __name__ == '__main__':
    main()

Solution (Python):
a,b = map(int,input().split())

s = a*b
print(s+1-a-b)

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi

A, B = ri_()
print((A-1)*(B-1))

Solution (Python):
a, b = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
A, B = list(map(int,input().split()))
print((A-1)*(B-1))

Solution (Python):
a, b = map(int, input().split(" "))
print((a-1)*(b-1))

Solution (Python):
n,m=map(int,input().split())
print((n-1)*(m-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
A,B=map(int, input().split())
print(A*B-A-B+1)

Solution (Python):
a, b = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
h, w = map(int, input().split())
print(h * w - (h + w - 1))

Solution (Python):
a,b = map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a,b = map(int, input().split())
print(a*b - a - b +1)

Solution (Python):
a,b=map(int,input().split());print((a-1)*(b-1))

Solution (Python):
A, B = map(int, input().split())
print((A-1)*(B-1))

Solution (Python):


A, B = map(int, input().split())

print(A*B-(A+B-1))

Solution (Python):
a,b=map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
a, b = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):

a, b = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a, b = [int(x) for x in input().split()]
print((a-1)*(b-1))

Solution (Python):

a, b = map(int, input().split())
print(a * b - a - b + 1)

Solution (Python):
A,B=map(int,input().split())
print(A*B-A-B+1)

Solution (Python):
a, b = map(int, input().split())

print((a-1)*(b-1))

Solution (Python):
A, B = map(int, input().split())
print((A-1)*(B-1))

Solution (Python):
a, b = map(int, input().split())
print((a - 1) * (b - 1))

Solution (Python):
a, b = map(int, input().split())
 
print( (a-1)*(b-1))

Solution (Python):
A, B = map(int, input().split())

print(A * B - A - B + 1)

Solution (Python):
a, b = list(map(int, input().split()))

print((a-1)*(b-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
A, B= map(int, input().split())

print((A-1)*(B-1))

Solution (Python):
a, b = map(int, input().split())
zentai = a * b
tate = 1 * a
yoko = 1 * b
michi = tate + yoko -1 
hatake = zentai - michi
print(hatake)

Solution (Python):
a,b = list(map(int, input().split()))
area = a*b-b*1-a*1+1
print(area)

Solution (Python):
a,b=map(int,input().split())

print((a-1)*(b-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a,b=map(int,input().split())
ans=a*b-(a+b-1)
print(ans)

Solution (Python):
A, B = map(int, input().split())
print(A*B-(A+B-1))

Solution (Python):
a,b=map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
A, B = map(int, input().split())
print(A * B - (A + B - 1))

Solution (Python):
A, B = map(int, input().split())
print((A - 1) * (B - 1))

Solution (Python):
a,b = map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b=map(int, input().split())
    print((a-1)*(b-1))
resolve()

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b=map(int, input().split())
    print(a*b-a-b+1)
resolve()

Solution (Python):
a,b=map(int,input().split())
print(~-a*~-b)

Solution (Python):
n, i = map(int, input().split())
print((n-1)*(i-1))

Solution (Python):
a,b=map(int,input().split())
print(a*b-a-b+1)

Solution (Python):
a,b=map(int,input().split())
ans=a*b-(a+b-1)
print(ans)

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a,b = map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a,b=map(int,input().split())
ans=(a-1)*(b-1)
print(ans)

Solution (Python):
a,b=map(int,input().split())
print(a*b-a-b+1)

Solution (Python):
a, b = map(int, input().split())
print((a - 1) * (b - 1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
print(a*b - ((a+b) - 1))

Solution (Python):
a, b = map(int, input().split())
print((a - 1) * (b - 1))

Solution (Python):
a, b = map(int, input().split())
print(a*b -a-b+1)

Solution (Python):

import sys


def solve(A: int, B: int):
    print((A - 1) * (B - 1))


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    solve(A, B)


if __name__ == '__main__':
    main()

Solution (Python):
A, B = list(map(int,input().split()))
print(A*B-A-B+1)

Solution (Python):
A,B=map(int,input().split())
print((A-1)*(B-1))

Solution (Python):
n, k = map(int, input().split())
print((n-1)*(k-1))

Solution (Python):
A,B=map(int, input().split())

print((A-1)*(B-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B= MAP()
print((A-1)*(B-1))

Solution (Python):
a,b=map(int,input().split())
print(a*b-a-b+1)

Solution (Python):
A, B = map(int, input().split())
print((A - 1) * (B - 1))

Solution (Python):
A, B = map(int, input().split())

print((A-1)*(B-1))

Solution (Python):
a,b=[int(i) for i in input().split()]
print((a-1)*(b-1))

Solution (Python):
a,b = map(int,input().split())

print((a-1)*(b-1))

Solution (Python):
def main():
    A, B = map(int, input().split())
    print((A-1)*(B-1))
if __name__ == "__main__":
    main()

Solution (Python):
a, b = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
a,b = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
a, b = map(int, input().split())
road = (1*b + 1*a)-1
print(a * b - road)

Solution (Python):
a, b = map(int, input().split())

ans = a * b - a - b + 1
print(ans)

Solution (Python):
n,m = map(int,input().split())
print((n-1)*(m-1))

Solution (Python):
a,b = map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a  , b = map(int ,input().split())
print((a - 1) * (b - 1))

Solution (Python):
a , b = map(int ,input().split())

print((a * b)  - (a + b - 1))

Solution (Python):
a, b = map(int, input().split())
print(a*b-(a+b-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1) * (b-1))

Solution (Python):
a,b=map(int , input().split())

print(a*b-a-b+1)

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a, b = map(int,input().split())

print((a - 1)*(b - 1))

Solution (Python):
A,B=map(int,input().split())
print (A*B-A-B+1)

Solution (Python):
a,b = map(int,input().split())
print((a-1) * (b-1))

Solution (Python):
a, b = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
A, B = map(int, input().split())

print(A*B - A - B + 1)

Solution (Python):
A, B = map(int, input().split())
print((A-1)*(B-1))

Solution (Python):
A, B = map(int, input().split())

print( (A - 1) * (B - 1) )

Solution (Python):
a, b = map(int, input().split())

print((a-1)*(b-1))

Solution (Python):
A, B = map(int, input().split())
print((A - 1) * (B - 1))

Solution (Python):
a,b=map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
A, B = map(int, input().split())
print((A-1)*(B-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a,b=map(int, input().split())
print(a*b-(a+b)+1)

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a,b = map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
A, B = map(int,input().split())
print((A-1) * (B-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
A, B = map(int, input().split())
print((A-1)*(B-1))

Solution (Python):
a,b = map(int,input().split())
sqr = a * b
minus = a+b-1
print(sqr-minus)

Solution (Python):
a , b = map(int,input().split())

print((a-1) * (b-1))

Solution (Python):
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

A, B = nm()

print(A * B - A - B + 1)

Solution (Python):
icase=0
if icase==0:
    a,b=map(int,input().split())
    print((a-1)*(b-1))

Solution (Python):
A,B = map(int,(input().split()))
print(A*B-A-B+1)

Solution (Python):
x, y = map(int,input().split())
print((x-1)*(y-1))

Solution (Python):
import math
import collections
import sys
 

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
 
a,b=MI()
ans=a*b-a-b+1
print(ans)

Solution (Python):
a,b = map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a, b = map(int, input().split())
print(a * b - (a + b - 1))

Solution (Python):
A,B = map(int,input().split())

print(A*B - B - (A-1))

Solution (Python):
a,b = map(int,input().split())

print((a-1)*(b-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a,b = map(int,input().split())

print((a-1)*(b-1))

Solution (Python):
x = list(map(int,input().split(" ")))
a = x[0]
b = x[1]

menseki = a * b - ( b + a - 1 )
print(menseki)

Solution (Python):
a,b = list(map(int,input().split()))
print((a-1)*(b-1))

Solution (Python):
a, b  = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
A,B = map(int,input().split())
print(A*B-A-B+1)

Solution (Python):

a,b = map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a, b = map(int, input().split())

print((a-1)*(b-1))

Solution (Python):
def main():
  
  
  
  a,b = list(map(int,input().split()))
  
  
  
  
  ans = 0
  count = 0
  lis = []
  print((a-1)*(b-1))

if __name__ == '__main__':
  main()

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
A, B = map(int, input().split())
print((A - 1)*(B - 1))

Solution (Python):
A, B = map(int, input().split())
print(A*B-(A+B-1))

Solution (Python):
a, b = map(int, input().split())

print(a*b-(a+b-1))

Solution (Python):
A,B=map(int,input().split())
print((A-1)*(B-1))

Solution (Python):
A,B=map(int,input().split())
print((A-1)*(B-1))

Solution (Python):
a, b = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
a,b=map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
A, B= map(int, input().split())
print((A-1)*(B-1))

Solution (Python):
A, B =map(int, input().split())
print((A-1)*(B-1))

Solution (Python):
n,m = list(map(int,input().split()))
print((n-1) * (m - 1))

Solution (Python):
A,B = map(int,input().split())
print(A*B-A-B+1)

Solution (Python):
a,b = map(int,input().split())

s = (a-1)*(b-1)
print(s)

Solution (Python):
A, B = map(int, input().split())
print((A-1)*(B-1))

Solution (Python):
A,B = map(int, input().split())
print(A*B-(A+B-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):


import collections


def solve():

    A, B = map(int, input().split())
    print(A*B-(A+B-1))


if __name__ == "__main__":
    solve()

Solution (Python):
a,b = map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
A, B = map(int,input().split())
print((A - 1) * (B - 1))

Solution (Python):
a, b = map(int, input().split())
print((a-1) * (b-1))

Solution (Python):
A,B=list(map(int,input().split()))
print((A-1)*(B-1))

Solution (Python):
A, B = map(int, input().split())
print((A-1)*(B-1))

Solution (Python):
a,b=[int(i) for i in input().split()]
print((a-1)*(b-1))

Solution (Python):
a,b = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
A, B = map(int,input().split()) 
print((A-1) * (B-1))

Solution (Python):
a,b = map(int,(input().split()))
print((a * b) - (a+b-1))

Solution (Python):
a, b = map(int, input().split())
print((a - 1) * (b - 1))

Solution (Python):
n,m = map(int,input().split())
print((n-1)*(m-1))

Solution (Python):
A, B = map(int, input().split())
print((A-1)*(B-1))

Solution (Python):
a, b = map(int, input().split())
print((a - 1) * (b - 1))

Solution (Python):
print(eval("("+input().replace(" ", "-1)*(")+"-1)"))

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = False

a, b = MAP()
print((a - 1) * (b - 1))

Solution (Python):
a, b = map(int, input().split())

print((a-1)*(b-1))

Solution (Python):
a,b = map(int,input().split())

print(a*b-(a+b)+1)

Solution (Python):
a, b = [int(x) for x in input().split()]

print((a-1)*(b-1))

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a,b=map(int,input().split())
print(~-a*~-b)

Solution (Python):
a, b = map(int, input().split())
print(a * b - (a + b -1))

Solution (Python):
A,B = map(int,input().split())
print((A-1)*(B-1))

Solution (Python):
A,B = map(int,input().split())
print((A-1)*(B-1))

Solution (Python):
A,B = map(int,input().split())

print(A*B-A-B+1)

Solution (Python):
a,b=map(lambda x: int(x)-1,input().split())
print(a*b)

Solution (Python):
def Garden(a , b):

    return a * b - (a + b) + 1

def main():
    a , b = map(int , input().split())
    print(Garden(a , b))

if __name__ == '__main__':
    main()

Solution (Python):
A,B= map(int,input().split())
print(A*B-A-B+1)

Solution (Python):
a, b = map(int, input().split())
print(a * b - (a + b -1))

Solution (Python):
A,B = map(int,input().split())
print((A-1)*(B-1))

Solution (Python):
p,q= input().split()
a,b =(int(p), int(q))
print(a*b -a -b +1)

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a,b = LI()
print(a*b - a - b + 1)

Solution (Python):
a,b = map(int, input().split())

print(a*b-a-b +1)

Solution (Python):
x,y=map(int,input().split())
print((x-1)*(y-1))

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect




from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
from datetime import datetime as dt

def main():
  a, b = map(int, readline().split())
  print((a-1)*(b-1))
  
  
  
if __name__ == '__main__':
  main()

Solution (Python):
a,b=map(int, input().split())

print((a-1)*(b-1))

Solution (Python):
A,B=map(int,input().split())
print((A-1)*(B-1))

Solution (Python):

a, b = [int(s) for s in input().split()]
print((a - 1) * (b - 1))

Solution (Python):
import sys

def resolve():
    H, W = map(int, input().split(" "))
    print((H-1)*(W-1))

if '__main__' == __name__:
    resolve()

Solution (Python):
a,b = [int(x) for x in input().split()]
print((a-1)*(b-1))

Solution (Python):
A,B = map(int,input().split())

print(A*B-(A+B-1))

Solution (Python):
A, B = map(int, input().split())

print((A-1)*(B-1))

Solution (Python):
import itertools
import fractions
def main():
  a,b = map(int,input().split())
  print((a*b) - (1*b + (a-1)*1))
if __name__ == '__main__':
  main()

Solution (Python):
A,B=map(int,input().split())

print((A-1)*(B-1))

Solution (Python):

import sys


def solve(A: int, B: int):
    print((A-1) * (B-1))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    solve(A, B)

if __name__ == '__main__':
    main()

Solution (Python):
a,b=map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
A,B = map(int,input().split(" "))
print((A-1)*(B-1))

Solution (Python):
a,b = map(int, input().split())
print((a-1)*(b-1))

Solution (Python):
A, B = map(int, input().split())
print((A-1)*(B-1))

Solution (Python):
A, B = list(map(int, input().split()))
print(A*B-(A+B-1))

Solution (Python):
import sys

a, b = map(int, sys.stdin.readline().split())

def main():
    ans = a * b - (a + b - 1)
    print(ans)

if __name__ ==  '__main__':
    main()

Solution (Python):
A, B = map(int, input().split())
print(A*B-A-B+1)

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    a = [int(i) for i in input().split()]

    print((a[0]-1)*(a[1]-1))

Solution (Python):
a,b = map(int,input().split())
print((a-1)*(b-1))

Solution (Python):
a, b = map(int, input().split())
res = a * b - (a + b - 1)
print(res)

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip() 

def resolve():
    A, B = map(int, input().split())
    print((A-1)*(B-1))

if __name__ == '__main__':
    resolve()

Solution (Python):
a,b = map(int,input().split())
print((a-1)*(b-1))