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

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(10000)


def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(A, B):
    return A*B - (A+B) + 1


def main():
    A, B = read_int_n()
    print(slv(A, B))


if __name__ == '__main__':
    main()

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

Solution (Python):
n, m = map(int, input().split())
print((m - 1) * (n - 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())
res = (a - 1) * (b - 1)
print(res)

Solution (Python):
num = [int(num) for num in input().split()]
s = num[0]
t = num[1]
print((s-1)*(t-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()))
    print((a - 1) * (b - 1))


if __name__ == '__main__':
    main()

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

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

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):
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*B - A - B + 1)

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

Solution (Python):

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

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

Solution (Python):
def main():
    A, B = map(int, input().split())
    output = A*B - A - B + 1
    return output

if __name__ == '__main__':
    print(main())

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

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

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

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

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

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


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

Solution (Python):
a,b = 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):


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

Solution (Python):

def inpl(): return map(int, input().split())
A, B = inpl()
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())
c=(a*b)-(b+a-1)
print(c)

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

print((B-1)*(C-1))

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

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

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

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

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

Solution (Python):
n=[int(i) for i in input().split()]
print((n[0]-1)*(n[1]-1))

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

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

Solution (Python):


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

Solution (Python):
import math, string, fractions, heapq, re, array, bisect, sys, random, time, copy
import itertools as it
import collections as cl
import functools as ft

def LI(): return list(map(int, input().split()))
def LI_(): return list(map(lambda x: int(x) - 1, input().split()))
def LF(): return list(map(float, input().split()))
def LS(): return input().split()
def I(): return int(input())
def F(): return float(input())
def S(): return input()

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

Solution (Python):
x,y = [int(x) for x in 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())

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

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

Solution (Python):



x,y = list(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 = (int(i) for i in 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,raw_input().split())
print a*b - a-b+1

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

Solution (Python):
import numpy as np
import math

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

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

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

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(10000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]




dp = None


def main():
    A, B = li_input()
    print((A - 1) * (B - 1))


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):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())

A,B = inpl()
print(A*B-A-B+1)