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):



def main():
    a, b = list(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())

R = (A - 1) * (B - 1)

print(R)

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 = input().split(' ')

a = int(a)
b = int(b)

m2 = (a - 1) * (b - 1)

print(m2)

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*b-a-b+1)

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

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

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

Solution (Python):
A, B = [int(_) for _ in 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*m-(n+m-1))

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):
import subprocess
A,B = map(int, subprocess.check_output("dd").split())
print (A-1)*(B-1)

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

Solution (Python):
from sys import stdin
a,b = map(int,stdin.readline().split())
print a*b + 1 - 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-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-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):
input_s = str(input())
[a, b] = list(map(int, input_s.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 = [int(x) for x in input().split()]
print(a * b - a - b + 1)

Solution (Python):


l = input().split()
a = int(l[0])
b = int(l[1])

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

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

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

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

Solution (Python):
a = input().split()
m = int(a[0])
n = int(a[1])
 
print(m*n - m - n +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())
load = 1 * a + 1 * b - 1
print(a * b - load )

Solution (Python):
A, B = map(int, input().strip().split())
area = A * B - A - B + 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())
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, raw_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())
C = (A - 1) * (B - 1)
print(C)

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

Solution (Python):


from collections import deque
import itertools as it
import sys
import math

sys.setrecursionlimit(10000000)

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

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

Solution (Python):
def solution(a, b):
    return a * b - (a + b - 1)

def main():
    a, b = [int(i) for i in raw_input().strip().split()]
    print solution(a, b)

if __name__ == '__main__':
    main()

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

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

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):
a, b = [int(x) for x in 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):
print((lambda a:(int(a[0])-1)*(int(a[1])-1))(input().split()))

Solution (Python):

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

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

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

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

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

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

Solution (Python):
def square():
    x,y=[int(i) for i in input().split()]
    print( x*y-x-y+1)

square()

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

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

print(int(res))

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

Solution (Python):
a = list(map(int,input().split()))
print((a[0]-1)*(a[1]-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*b-(a+b-int(1)))

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

Solution (Python):
A,B = map(int, raw_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(i) for i in input().split()]

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

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

Solution (Python):
l = input().split()
a = int(l[0]) -1
b = int(l[1]) -1

print(a * b)

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

Solution (Python):

import sys

def main():
    a, b = [int(x) for x in sys.stdin.readline().rstrip().split()]
    print((a-1)*(b-1))
    

if __name__ == '__main__':
    main()

Solution (Python):
input_lines = input().split()
a = int(input_lines[0])
b = int(input_lines[1])

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

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

Solution (Python):
l = input().split()
S = 4*(((int(l[0])-1)/2) *((int(l[1])-1)/2))
print(int(S))

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())
A-=1
B-=1
print(A*B)

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

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

Solution (Python):
import sys,collections,math;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

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

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

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

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())

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

Solution (Python):
a, b = (int(i) for i in input().split())

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

Solution (Python):
import sys

def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [A, B] = [long(input_raw[0]), long(input_raw[1])]
    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=input().split()
a=int(a)
b=int(b)
c=a*b
c=c-a-b+1
print(c)

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

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

print(N[0]*N[1]-N[0]-N[1]+1)

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

Solution (Python):
a=input().split();print((int(a[0])-1)*(int(a[1])-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):

line = input().split(" ")
a = int(line[0])
b = int(line[1])

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):
x,y=input().split(' ')
x=int(x)
y=int(y)
print(x*y-x-y+1)

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

Solution (Python):
A = list(map(int, input().split()))
x = A[0]
y = A[1]

N = (x - 1)*(y - 1)
print(N)

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

Solution (Python):
lst = list(map(int,input().split()))
A = lst[0]
B = lst[1]
S = (A-1)*(B-1)
print(S)

Solution (Python):
ab = input().split()
print((int(ab[0])-1)*(int(ab[1])-1))

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

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

print((L[0]-1)*(L[1]-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):
l = input().split()
A = int(l[0])
B = int(l[1])
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 = list(map(int,input().split()))
print(a * b - a - b + 1)

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

Solution (Python):
AB = input()

A = int(AB.split(" ")[0])
B = int(AB.split(" ")[1])
ans = (A-1)*(B-1)
print(ans)

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

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):
inputs = raw_input().replace("\n", "")
input1, input2 = map(int, inputs.split(" "))
print (input1 - 1) * (input2 - 1)

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

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())
c=(a-1)*(b-1)
print(c)

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):
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):
l = map(int, raw_input().split())


s = (l[0] - 1) * (l[1] - 1)
print(s)

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

Solution (Python):


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

area = (a-1)*(b-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-1)*(b-1)
print(ans)

Solution (Python):
a, b = map(int, input().split())
if a == 2 or b == 2:
    print(1)
else:
    print(a*b - (a + 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*b - a - b + 1)

Solution (Python):
i = input()
A = i.split(" ")[0]
B = i.split(" ")[1]
print((int(A)-1)*(int(B)-1))

Solution (Python):
l = input().split()
A = int(l[0])
B = int(l[1])

total = A * B
michi = A + B - 1
hatake = total - michi


print(hatake)

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

Solution (Python):


a, b = (int(v) for v in input().strip().split())

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

Solution (Python):
A = raw_input()
B = A.split()

numA = int(B[0])
numB = int(B[1])

men = numA*numB-numA-numB+1

print men

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

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

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

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*b-a-b+1)

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

Solution (Python):
inp = input()
inp = inp.split()
men = (int(inp[0]) - 1 ) * (int(inp[1]) - 1)
print(men)

Solution (Python):
s = input()
a, b = [int(x) for x in s.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())
c=(a-1)*(b-1)
print(c)

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

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

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

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 = list(map(int, input().split()))

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

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

    return a * b - a - b + 1


print(abc106_a())

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

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

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

    print((a-1) * (b-1))
        
if __name__ == '__main__':
    main()

Solution (Python):
A,B = (int(i) for i in 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,raw_input().split())

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

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

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

Solution (Python):
n = input().split(" ")
b = (int(n[0])-1) * (int(n[1])-1)
print(b)

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


if __name__ == '__main__':
    main()

Solution (Python):
A,B=[int(i) for i in 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*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):
B = input().split()
A = int(B[0])-1
B = int(B[1])-1
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):
_ = str(input()).split(" ")
A, B = int(_[0]), int(_[1])

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

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

Solution (Python):
def menseki(a, b):
    return a * b - (1 * b + 1 * a - 1)

if __name__ == '__main__':
    la, lb = map(int, input().split())
    print(menseki(la, lb))

Solution (Python):
a, b = tuple(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):
def SolveABC106A(A,B):
    print (int(A)-1) * (int(B)-1)

A, B = map(int, raw_input().split())
SolveABC106A(A,B)

Solution (Python):

import logging
import time


class Solver:
    def __init__(self):
        self.a = 0
        self.b = 0

    
    def input_value(self):
        
        
        
        
        
        self.a, self.b = map(int, input().split())

    @staticmethod
    def run(a, b):
        return a * b - a - b + 1

    @staticmethod
    def test():
        start_time = time.time()

        assert Solver.run(2) == 2, 'Error.'

        elapsed_time = time.time() - start_time
        logging.debug('elapsed_time: {0}'.format(elapsed_time) + '[sec]')


if __name__ == '__main__':
    logging.basicConfig(level=logging.DEBUG)

    solver = Solver()
    

    solver.input_value()
    ans = solver.run(solver.a, solver.b)
    print(str(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):
List = list(map(int, input().split()))
a = List[0]
b = List[1]



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

print(s)

Solution (Python):

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

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

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

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

Solution (Python):

buf = input().split()
A = int(buf[0])
B = int(buf[1])
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 = input().split()
A = int(A)
B = int(B)

print((A-1) * (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 = [int(item) for item 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())
ans=(A-1)*(B-1)
print(str(ans))

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

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

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

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

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

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

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

Solution (Python):
A, B = map(int, input().split())
ans = A * B
ans = ans - (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 - A - B + 1)

Solution (Python):


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

area = (A-1) * (B-1)

print(area)

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

Solution (Python):




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

tmp = A * B - (A + B - 1)

print(tmp)

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):
from sys import stdin, stdout

input = lambda: stdin.readline()
write = stdout.write

def main():
    A, B = map(int, input().split())

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

main()

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

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

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

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

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

Solution (Python):
from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect

def read():
  return int(input())

def reads():
  return [int(x) for x in input().split()]

A, B = reads()

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

Solution (Python):


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

Solution (Python):
A, B = [ int(i) for i in 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()))

S = (A - 1) * (B - 1)

print(S)

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

Solution (Python):



i = input().split(' ')
a = int(i[0])
b = int(i[1])

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

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

Solution (Python):





def main(a, b):
    retval = a * b - a * 1 - b * 1 +  1 * 1
    print(retval)
    
if __name__ == '__main__':
    try:
        a, b = list(map(int,input().strip().split(" ")))
        main(a, b)
    except EOFError:
        pass

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

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

Solution (Python):
l=list(map(int,input().split()))
a=l[0]
b=l[1]
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 =  [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):
def main():
    A, B = map(int, input().split())

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


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(" "))

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

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

Solution (Python):
from sys import stdin

A, B = [int(x) for x in stdin.readline().rstrip().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())
ans = (A * B) - (1 * A + 1 * B - 1)
print(ans)

Solution (Python):
a,b =input().split()
print((int(a) - 1) * (int(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 , raw_input().split() )
print A*B-A-B+1

Solution (Python):


def main():
    a, b = 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())


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())

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())

C = A*B - A - B +1

print(C)

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

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

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

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

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

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

print(listA[0]*listA[1]-(listA[0]+listA[1]-1))

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

Solution (Python):

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

Solution (Python):

import math,string,itertools,fractions,heapq,collections,re,array,bisect

def s():
    return input()
def n():
    return int(input())
def d():
    return float(input())

def ls():
    return input().split()
def ln():
    return map(int, input().split())
def ld():
    return map(float, input().split())

def fs():
    return [input() for i in range(input())]
def fn():
    return [int(input()) for i in range(input())]
def fd():
    return [float(input()) for i in range(input())]

A,B = ln()


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())

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 = list(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(i) for i in input().split()]

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

Solution (Python):
line = input().split()
A = int(line[0])
B = int(line[1])

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):
def i1():
 return int(input())
def i2():
 return [int(i) for i in input().split()]

[a,b]=i2()
print(a*b-a-b+1)

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

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*b - (a+b-1))

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

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

Solution (Python):
def run(a, b):
    return (a-1)*(b-1)


def read_line():
    a, b = input().split()
    a = int(a)
    b = int(b)
    return (a, b)


def main():
    a, b = read_line()
    print(run(a, b))


if __name__ == '__main__':
    main()

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

print((int(a) - 1) * (int(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 = tuple(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):
a, b = list(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-1)*(B-1))

Solution (Python):
a, b = [int(v) for v in 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 = list(map(int, input().split()))

total = a * b - (a + b - 1)

print(total)

Solution (Python):


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

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

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(" "))
A -= 1
B -= 1
print(A*B)

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

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

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

Solution (Python):
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()

A, B=na()

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-(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*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())
area = (A - 1) * (B - 1)
print(area)

Solution (Python):
X,Y=map(int,input().split())

ans=X*Y-(X+Y-1)

print(ans)

Solution (Python):

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




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

Solution (Python):
data = input()
xy = data.split()

rd = int(xy[0])+int(xy[1])-1

ans = int(xy[0])*int(xy[1])-rd

print(ans)

Solution (Python):
from sys import stdin


def main():
    A, B = [int(x) for x in stdin.readline().rstrip().split()]
    print(A * B - (A + B - 1))


if __name__ == '__main__':
    main()

Solution (Python):


import math
import sys
import itertools
import numpy as np


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 = input().split()
c = (int(a)-1) * (int(b)-1)
print(c)

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

Solution (Python):
A, B = [int(i) for i in input().strip().split(" ")]

print(A*B - A - 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())

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


if __name__ == '__main__':
    main()

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

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