Problem:


Score : 100 points

Problem Statement

In K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?

Constraints

2 ≤ n, m ≤ 100

Input

Input is given from Standard Input in the following format:

n m

Output

Print the number of blocks in K-city.

Sample Input 1

3 4

Sample Output 1

6

There are six blocks, as shown below:

Sample Input 2

2 2

Sample Output 2

1

There are one block, as shown below:



Sample input:
3 4


Sample output:
6

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
a,b=map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input().split()
n, m = int(s[0]), int(s[1])
print((n - 1) * (m - 1))

Submission status: Accepted

Solution code:
import sys
import copy
import  math
import bisect
from collections import *
from operator import itemgetter
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

n, m = na()
print((n - 1) * (m - 1))

Submission status: Accepted

Solution code:
n,m = (int(i) for i in input().split())

ans = (n - 1) * (m - 1)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = [int(_) for _ in input().split()]
if len(n) == 2 and all(2 <= item <= 100 for item in n):
    print((n[0] - 1) * (n[1] - 1))
else:
    print('hoge!')

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m = map(int, input().split())

print( (n-1)*(m-1))

Submission status: Accepted

Solution code:
def main():
    n, m = map(int, input().split())
    return (m-1) * (n-1)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = (int(i) for i in input().split())
row = n - 1
col = m - 1
print(row*col)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
print((N-1)*(K-1))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
(n, m) = (int(tok) for tok in input().split())
print((n - 1) * (m - 1))

Submission status: Accepted

Solution code:
n, m  = map(int, input().split())

print((n-1)*(m-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = map(int, input().split())

print((n-1) * (m-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
H,V = map(int,input().split())
print((H-1)*(V-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,M = map(int,input().split())
print((N - 1) * (M - 1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(n: int, m: int):
    print((n-1)*(m-1))
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    n = int(next(tokens))  # type: int
    m = int(next(tokens))  # type: int
    solve(n, m)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

n, m=map(int,input().split())

A = (n-1)*(m-1)

print(A)

Submission status: Accepted

Solution code:
n,m=map(int,input().split());print(~-m*~-n)

Submission status: Accepted

Solution code:
#69

n, m = map(int, input().rstrip().split())

print((n-1)*(m-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = map(int, input().split())

print((n+1)*(m+1) - ((n+1)*2) - ((m+1)*2) + 4)

Submission status: Accepted

Solution code:
n,m=[int(x) for x in input().split()]
print((n-1)*(m-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)


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

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(l):
	x = l.pop()
	y = l.pop()
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	l.append(min(x,y))
	return gcd(l) if len(l) > 1 else l[0]

class Queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class Stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

Submission status: Accepted

Solution code:
r, c = [int(x) for x in input().split()]
print((r-1)*(c-1))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    n,m = inputMap()
    
    print((n-1) * (m-1))
    
    
if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n = int(input())
#a = int(input())
#ls = list(input().split(" "))
#ls = list(map(int,input().split(" ")))
n,m = list(map(int,input().split(" ")))
#string = input()

print((n-1)*(m-1))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
n,m = [int(i) for i in input().split()]

K = (n - 1) * (m - 1)
print(K)

Submission status: Accepted

Solution code:
n,m =map(int,input().split())

print((n-1)*(m-1))

Submission status: Accepted

Solution code:
a = input()
print(((int(a.split(' ')[0]) - 1) * (int(a.split(' ')[1]) - 1)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = [int(elem) for elem in input().split()]
print((n - 1) * (m - 1))

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
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 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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

n, m = MAP()

print((n-1) * (m-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m = input().split()

n = int(n)
m = int(m)


print((m-1)*(n-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
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 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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, M = MAP()
l = N - 1
w = M - 1
ans = l * w
print(ans)

Submission status: Accepted

Solution code:
n, m = map(int, input().split())

print(int((n - 1) * (m - 1)))

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC69 A

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

n,m = map(int,input().split())

print((n-1)*(m-1))

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# input
n, m = map(int, input().split())

# solve & output
print((n - 1) * (m - 1))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

n, m = map(int, input().split())

# print(n)
# print(m)

print((n -1) * (m - 1))

Submission status: Accepted

Solution code:

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




if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

n, m = nl()
print((n -1)*(m-1))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(n: int, m: int):
    print((n - 1) * (m - 1))
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    n = int(next(tokens))  # type: int
    m = int(next(tokens))  # type: int
    solve(n, m)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r = list(map(lambda x:int(x)-1, input().split()))
print(r[0]*r[1])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(n: int, m: int):
    ret = (n - 1) * (m - 1)
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    n = int(next(tokens))  # type: int
    m = int(next(tokens))  # type: int
    solve(n, m)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


abc()

Submission status: Accepted

Solution code:
N, M = [int(s) for s in input().split()]
print((N - 1) * (M - 1))

Submission status: Accepted

Solution code:
n, m = [int(i) for i in input().split()]
print((n - 1) * (m - 1))

Submission status: Accepted

Solution code:
n, m = [int(x) for x in input().split()]
print((n-1)*(m-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m = map(int,input().split())

print((n - 1)*(m-1))

Submission status: Accepted

Solution code:
n, m = [ int(v) for v in input().split() ]
print((n-1)*(m-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
first = input()
(n,m) = first.split()
int_n = int(n)
int_m = int(m)
int_n -= 1
int_m -= 1
print(int_n*int_m)

Submission status: Accepted

Solution code:
tree = input()
(n,m)=tree.split()
a = int(n)-1
b = int(m)-1
print (a*b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m=map(int,input().split())

print((n-1)*(m-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m = [int(i) for i in input().split()]
if 2 <= n and m <= 100:
    a = int((n - 1)*(m - 1))
    print(a)

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc069/tasks/abc069_a
n,m = map(int, input().split())
print((n-1)*(m-1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l=[int(i) for i in input().split()];print((l[0]-1)*(l[1]-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m=map(int, input().split())

print(int((n-1)*(m-1)))

Submission status: Accepted

Solution code:


def read_input():
    n, m = map(int, input().split())

    return n, m

def submit():
    n, m = read_input()
    print((n - 1)*(m - 1))



if __name__ == '__main__':
    submit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    n,m = f()
    print((n-1)*(m-1))

solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n, m = map(int, input().split())

print((n-1) * (m-1))

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    c, d = (int(_) for _ in input().split())      
    print(((c-1)*(d-1)))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


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


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper

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

Submission status: Accepted

Solution code:
# ABC069A - K-City
n, m = list(map(int, input().rstrip().split()))
print((n - 1) * (m - 1))

Submission status: Accepted

Solution code:
n, m = [int(n) for n in input().split()]
print((n - 1) * (m - 1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = [int(item) for item in input().split()]
print((n-1) * (m-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

n, m = map(int, input().split())

print((n-1)*(m-1))

Submission status: Accepted

Solution code:
n,m=map(int,input().split(' '))
a=n-1
b=m-1
print(a*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    n, m = map(int, input().split())

    return (n-1) * (m-1)


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

Submission status: Accepted

Solution code:
x,y = map(int,input().split())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n,m = map(int,input().split())

print(max(0,(n-1)*(m-1)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A 068

n,m =map(int,input().split())

print((n-1)*(m-1))

Submission status: Accepted

Solution code:
def k_city(n: int, m: int)->int:
    return (n-1)*(m-1)


if __name__ == "__main__":
    n, m = map(int, input().split())
    ans = k_city(n, m)
    print(ans)

Submission status: Accepted

Solution code:
n, m = [int(_) for _ in input().split()]
print((n-1)*(m-1))

Submission status: Accepted

Solution code:
n,m = [int(x) for x in input().split()]
print((n-1)*(m-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007

#A
def A():
    n, m = LI()
    print((n-1)*(m-1))
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
n,m = LI()
print((n-1)*(m-1))
#B

#C
"""
n = I()
a = LI()
d = [0,0]
for i in a:
    if i%2:
        d[0] += 1
    if i%4 == 0:
        d[1] += 1
if n % 2:
    d[0] -= 1
d[0] -= d[1]
if d[0] <= 0:
    print("Yes")
else:
    print("No")
"""

#D
"""
h,w = LI()
n = I()
a = LI()
c = [[None for x in range(w)] for y in range(h)]
i = 0
for y in range(h):
    if y%2:
        for x in range(w)[::-1]:
            if not a[i]:
                i += 1
            c[y][x] = i+1
            a[i] -= 1
    else:
        for x in range(w):
            if not a[i]:
                i += 1
            c[y][x] = i+1
            a[i] -= 1
for i in c:
    print(*i)
"""

#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

Solution code:
n,m=(int(x) for x in input().split())

print((n-1)*(m-1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    n, m = map(int, input().split())
    result = (n - 1) * (m - 1)
    print(result)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n,m = (int(i) for i in input().split())

print((n-1)*(m-1))

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
a, b = [int(x) for x in stdin.readline().rstrip().split()]
print((a-1)*(b-1))

Submission status: Accepted

Solution code:
n,m=[int(i) for i in input().split()]
print((n-1)*(m-1))

Submission status: Accepted

Solution code:
# coding: utf-8
a, b = map(int, input().split())
print((a - 1)*(b - 1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = [ int(x) for x in input().split() ]

ans = (n - 1) * (m - 1)

print(ans)
print()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N , M = map(int,input().split())
print((M-1)*(N-1))

Submission status: Accepted

Solution code:
test_input = input().split()
n = int(test_input[0])
m = int(test_input[1])
print((n - 1) * (m - 1))

Submission status: Accepted

Solution code:
int_n, int_m = map(int, input().split())

print((int_n - 1) * (int_m - 1))

Submission status: Accepted

Solution code:
n, m = list(map(int, input().split()))

ans = (n - 1) * (m - 1)
print(ans)

Submission status: Accepted

Solution code:
# ABC 069
def getIntList(): return [int(x) for x in input().split()]
n,m = getIntList()
print((n-1)*(m-1))

Submission status: Accepted

Solution code:
N,M = map(int,input().split())
print(((N-1)*(M-1)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m =  (int(_) for _ in input().split())  
print((n-1)*(m-1))

Submission status: Accepted

Solution code:
n,m = [int(i) -1 for i in input().split()]
print(n * m)

Submission status: Accepted

Solution code:
n,m=(int(i) for i in input().split())
print((n-1)*(m-1))

Submission status: Accepted

Solution code:
def inpl(): return list(map(int, input().split()))
n, m = inpl()
print((n-1) * (m - 1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


abc069_a()