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?
s = input()
print(s[0] + str(len(s[1:-1])) + s[-1])
n, m = map(int, input().split())

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