Problem:
 Score : 100 points    Problem Statement There are H rows and W columns of white square cells.  You will choose h of the rows and w of the columns, and paint all of the cells contained in those rows or columns.  How many white cells will remain?  It can be proved that this count does not depend on what rows and columns are chosen.      Constraints  All values in input are integers.  1 \leq H, W \leq 20  1 \leq h \leq H  1 \leq w \leq W         Input Input is given from Standard Input in the following format:  H  W  h  w       Output Print the number of white cells that will remain.        Sample Input 1 3 2
2 1      Sample Output 1 1  There are 3 rows and 2 columns of cells. When two rows and one column are chosen and painted in black, there is always one white cell that remains.       Sample Input 2 5 5
2 3      Sample Output 2 6       Sample Input 3 2 4
2 4      Sample Output 3 0

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())

print(H*W - (h*W + H*w - h*w))

Solution (Python):
H, W = [int(x) for x in input().split()]
h, w = [int(x) for x in input().split()]
print(H * W - (h * W + H * w - h * w))

Solution (Python):
H, W = [int(x) for x in input().split()]
h, w = [int(x) for x in input().split()]
print((H-h)*(W-w))

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

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

max_wh = H * W
black = h * W + w * H - h * w
print(max_wh - black)

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

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())

print(H*W - h*w - h*(W-w) - w*(H-h))

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

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

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

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

def resolve():
    H,W=map(int, input().split())
    h,w=map(int, input().split())
    zenbu=H*W
    print(zenbu-(h*W+w*H-h*w))
resolve()

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

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

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

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

print(H*W - (H*w + W*h - h*w))

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]




H, W = mi()
h, w = mi()

print((W-w)*(H-h))

Solution (Python):


H, W = map(int, input().split())
h, w = map(int, input().split())

print(H*W-h*W-H*w+h*w)

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

Solution (Python):
def white_cells(H, W, h, w):

    return (H-h) * (W-w)
def main():
    H, W = map(int, input().split())
    h, w = map(int, input().split())
    print(white_cells(H, W, h, w))

if __name__ == '__main__':
    main()

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())

print(H*W-(h*W + H*w -h*w))

Solution (Python):
import sys
import math
from collections import Counter
import itertools



def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())

def LI(): return list(map(int, sys.stdin.readline().split()))

def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'


p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")



H,W=MI()
h,w=MI()
print((H-h)*(W-w))

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

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

masu = H * W
zan = masu -((h*W)+(w*(H-h)))
print(zan)

Solution (Python):
h,w=map(int,input().split())
hh,ww=map(int,input().split())

print(h*w-(hh*w+ww*h-hh*ww))

Solution (Python):
x = input().split()
y = input().split()
H = int(x[0])
W = int(x[1])
h = int(y[0])
w = int(y[1])
white = (H * W) - ((h*W) + (w*H) - (h*w))
print(white)

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

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())
TOTAL = H * W
total = (W * h + H * w)-h*w
result = TOTAL - total
print(result)

Solution (Python):
H,W = map(int,input().split())
h,w = map(int, input().split())

ans = H*W -  ( h*W + H*w - h*w)
print(ans)

Solution (Python):
H,W=map(int, input().split())
h,w=map(int, input().split())

print((H-h)*(W-w))

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

Solution (Python):
def main():
    H, W = map(int, input().split())
    h, w = map(int, input().split())
    print((H-h)*(W-w))
if __name__ == "__main__":
    main()

Solution (Python):
H,W=[int(i)for i in input().split()]
h,w=[int(i)for i in input().split()]
print((H-h)*(W-w))

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    H, W = map(int, input().split())
    h, w = map(int, input().split())
    print(H*W - (h*W + w*H - h*w))

if __name__ == '__main__':
    main()

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

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

print((H-h)*(W-w))

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

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

print((H - h) * (W - w))

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

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

Solution (Python):
from sys import setrecursionlimit, exit
setrecursionlimit(1000000000)

def main():
    H, W = map(int, input().split())
    h, w = map(int, input().split())
    print((H - h) * (W - w))

main()

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

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

H, W = MAP()
h, w = MAP()
print(H*W - h*W - w*H + h*w)

Solution (Python):
a = list(map(int, input().split()))
b = list(map(int, input().split()))
H = a[0]
W = a[1]
h = b[0]
w = b[1]
k = (H - h) * (W - w)
print(k)

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

print((H-h)*(W-w))

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

Solution (Python):

H, W = map(int, input().split())
h, w = map(int, input().split())
print((H - h ) * (W - w))

Solution (Python):
import numpy as np

H, W = map(int, input().split())
h, w = map(int, input().split())
table = np.ones((H, W), dtype='int')
table[:h,:] = 0
table[:,:w] = 0
num = np.sum(table)
print(num)

Solution (Python):
H,W=map(int,input().split())
h,w=map(int,input().split())

print(H*W-((H*w+W*h)-h*w))

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

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

sum = H*W
sum -= h*W + H*w -h*w

print(sum)

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

Solution (Python):
H,W=map(int, input().split())
h,w=map(int, input().split())

print((H-h)*(W-w))

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

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())

print((H-h)*(W-w))

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

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

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

Solution (Python):

import sys

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

H, W = lr()
h, w = lr()
answer = (H-h) * (W-w)
print(answer)

Solution (Python):

import sys

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

H, W = lr()
h, w = lr()
answer = H * W + h * w - h * W - w * H
print(answer)

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

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

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

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

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

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

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())
cell = H * W
line = h * W
row = w * H - h * w
print(cell - line - row)

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

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

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

print(H*W - W*h - H*w + h*w)

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

print(H * W - H * w - h * W + h * w)

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

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

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

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

delrow = h*W
delcol = w*H
dup = h*w
print(H*W - delrow - delcol + dup)

Solution (Python):
H,W=map(int,input().split())
h,w=map(int,input().split())

print(H*W-h*W-H*w+h*w)

Solution (Python):
icase=0
if icase==0:
    H,W=map(int,input().split())
    h,w=map(int,input().split())
    print((H-h)*(W-w))

Solution (Python):
H,W=[int(i)for i in input().split()]
h,w=[int(i)for i in input().split()]
print(H*W-h*W-H*w+h*w)

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

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

Solution (Python):
H, W = map(int, input().split())
h,w = map(int,input().split())

print((H-h)*(W-w))

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

Solution (Python):
def main():
    H, W = map(int, input().split())
    h, w = map(int, input().split())
    print((H - h) * (W - w))
main()

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

H,W=MI()
h,w=MI()
ans=H*W-h*W-H*w+h*w
print(ans)

Solution (Python):

import sys
input = sys.stdin.readline









H,W = map(int,input().split())
h,w = map(int,input().split())

print((H-h)*(W-w))

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())

print(H*W-h*W-w*H+h*w)

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

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

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

Solution (Python):
H,W=map(int,input().split())
h,w=map(int,input().split())
A=H*W
B=h*W
C=w*(H-h)
print(A-B-C)

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

subd = h * W + H * w - h * w
ans = H * W - subd

print(ans)

Solution (Python):
H,W=map(int, input().split())
h,w=map(int, input().split())

print((H-h)*(W-w))

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

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

Solution (Python):

H,W = map(int,input().split())
h,w = map(int,input().split())

print((H-h)*(W-w))

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

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())

print(H*W - h*W - H*w + h*w)

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

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

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())

print((H-h)*(W-w))

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

ans = (W-w) * (H-h)

print(ans)

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

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

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

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

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

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

Solution (Python):

H,W = map(int, input().split())
h,w = map(int, input().split())

print(H*W -h*W -H*w +h*w)

Solution (Python):


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

print((N-n) * (M-m))

Solution (Python):
H,W=map(int,input().split())
h,w=map(int,input().split())

print(H*W-(h*W+H*w-h*w))

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

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

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

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

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

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

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())
result = H*W - (h*w+h*(W-w)+w*(H-h))
print(str(result))

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

Solution (Python):













H,W = map(int,input().split())
h,w = map(int,input().split())

ans = H*W - (h*W + H*w - h*w)

print(ans)

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

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

Solution (Python):
H, W  = map(int, input().split())
h, w  = map(int, input().split())

print((H-h)*(W-w))

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

Solution (Python):
H,W= map(int, input().split())
h,w= map(int, input().split())

print(H*W-h*W-w*H+h*w)

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

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

ans = (H-h)*(W-w)
print(ans)

Solution (Python):
H,W=[int(i) for i in input().split()]
h,w=[int(i) for i in input().split()]

print(H*W-h*W-w*H+h*w)

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

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

H,W = map(int,input().split())
h,w = map(int,input().split())

if H-h >0  and W-w > 0:
    print((H-h)*(W-w))
else:
    print(0)

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

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    H, W = input_nums()
    h, w = input_nums()
    total = H*W
    print(total - (h*W + w*H - h*w))

if __name__ == '__main__':
    main()

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

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

Solution (Python):
H, W, h, w = map(int, open(0).read().split())
print((H-h)*(W-w))

Solution (Python):
data = input().rstrip().split()
mat=[[1 for i in range(int(data[1]))] for j in range(int(data[0]))]
n = input().rstrip().split()

for i2 in range(int(n[0])):
  for k in range(int(data[1])):
    mat[i2][k]=0

for j2 in range(int(n[1])):
  for k in range(int(data[0])):
    mat[k][j2]=0
ans=0
for l in range(len(mat)):
  ans+=sum(mat[l])
print(ans)

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

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

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

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

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

print((x-a)*(y-b))

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

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

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

H,W = LI()
h,w = LI()
print(H*W - h*W - H*w + h*w)

Solution (Python):
hh, ww = map(int,input().split())
h, w = map(int,input().split())

ans = hh*ww - h*ww - w*hh + h*w

print(ans)

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

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

Solution (Python):
H, W, h, w = map(int, open(0).read().split())

cnt = H * W
cnt -= h * W
cnt -= H * w
cnt += h * w

print(cnt)

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())

print(H*W-H*w-h*W+h*w)

Solution (Python):

H, W = [int(s) for s in input().split()]
h, w = [int(s) for s in input().split()]
print((H - h) * (W - w))

Solution (Python):
def main():
    H, W = map(int, input().split())
    h, w = map(int, input().split())
    print((H-h)*(W-w))
if __name__ == '__main__':
    main()

Solution (Python):
p,q= input().split()
a,b =(int(p), int(q))
P,Q= input().split()
A,B =(int(P), int(Q))
print(int((a-A)*(b-B)))

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

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

def main():
  H, W = map(int, readline().split())
  h, w = map(int, readline().split())
  ans = H*W - h*W -H*w +h*w
  print(ans)
  
  
  
if __name__ == '__main__':
  main()

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

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

print(H * W - (h * W + w * H - h * w))

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

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

Solution (Python):
import itertools
import fractions
def main():
  H,W = map(int,input().split())
  h,w = map(int,input().split())
  print((H-h)*(W-w))
if __name__ == '__main__':
  main()

Solution (Python):
h, w = map(int, input().split())
sh, sw = map(int, input().split())

dup = sh*sw
black = sh*w + sw*h - dup
white = h*w - black

print(white)

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby
    
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    

    
    

    H,W = map(int, input().split())
    h,w = map(int, input().split())
    print(H*W-h*W-w*H+h*w)

if __name__ == '__main__':
    main()

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

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())

print((H-h) * (W-w))

Solution (Python):
import sys

H, W, h, w = map(int, sys.stdin.read().split())

def main():
    res = H * W - (h*W + H*w - h*w)
    print(res)

if __name__ ==  '__main__':
    main()

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

ans = H*W - (h*W + w*H - h*w)
print(ans)

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

if __name__ == '__main__':
    a, b = map(int, input().split())
    c, d = map(int, input().split())

    print(a*b - (a*d + b*c-c*d) )

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

print((H-h)*(W-w))

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
H,W = iim()
h,w = iim()

print((H-h)*(W-w))

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())

print((H - h) * (W - w))

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

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

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())

print(H*W - h*W - H*w + h*w)

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

if __name__ == '__main__':
  main()

Solution (Python):
H,W = (int(x) for x in input().split())
h,w = (int(x) for x in input().split())
print(H*W-h*W-H*w+h*w)

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

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())

print((H-h)*(W-w))

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

print((a-c)*(b-d))

Solution (Python):
H,W,h,w=map(int,open(0).read().split());print((H-h)*(W-w))

Solution (Python):
H,W,h,w=map(int,open(0).read().split())
print((H-h)*(W-w))

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

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

Solution (Python):
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
from fractions import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

H, W = map(int, input().split())
h, w = map(int, input().split())
print(H * W - h * W - w * H + (h * w))

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

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

Solution (Python):


H, W = map(int, input().split())
h, w = map(int, input().split())


print((H - h) * (W -w))

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

Solution (Python):
H,W=map(int,input().split())
h,w=map(int,input().split())

print((H-h)*(W-w))

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())
result = H*W - (h*w+h*(W-w)+w*(H-h))
print(str(result))

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())
result = H*W - (h*w+h*(W-w)+w*(H-h))
print(str(result))

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

Solution (Python):
H,W=map(int,input().split())
h,w=map(int,input().split())
all=H*W
black=W*h+H*w
double=h*w
print(int(all)-int(black)+int(double))

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

Solution (Python):
a,b = map(int,input().split())
c,d = map(int,input().split())
e = a - c
f = b - d
print(e*f)

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

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

print((H-h)*(W-w))

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

Solution (Python):
def main():
    H, W = map(int, input().split())
    h, w = map(int, input().split())

    n_white = H*W - (h*W + w*H - h*w)
    print(n_white)
    

main()

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
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

H, W = MAP()
h, w = MAP()

print(H*W - H*w - h*W + h*w)

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

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

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

Solution (Python):
H,W = map(int,input().split())
h,w = map(int,input().split())

area = H*W

ans = area-(h*W+w*H)+h*w
print(ans)

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

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

Solution (Python):
import sys
import math
import string
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
from bisect import bisect, bisect_left, bisect_right

MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip()

sys.setrecursionlimit(10 ** 8)

H, W = map(int,input().split())
h, w = map(int,input().split())
print(H*W - h*W - (H-h)*w)

Solution (Python):
H, W = map(int, input().split())
h, w = map(int, input().split())

print((H - h) * (W - w))

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

Solution (Python):
H,W = map(int, input().split())
h,w = map(int, input().split())

print((H - h)*(W - w))

Solution (Python):
H,W = map(int, input().split())
h,w = map(int, input().split())

white = H*W
black = h*W + w*H - h*w
diff = white - black
print(diff)

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

Solution (Python):

import os
from sys import stdin







def main():
    input_line = stdin.readline().rstrip().split(' ')
    H,W = map(int, input_line)
    
    input_line = stdin.readline().rstrip().split(' ')
    h,w = map(int, input_line)
    print((H-h)*(W-w))

if __name__ == "__main__":
    main()

Solution (Python):
h,w = map(int,input().split())
s,t = map(int,input().split())

print((h-s)*(w-t))

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

print((A-a)*(B-b))

Solution (Python):
H,W=map(int,input().split())
h,w=map(int,input().split())
A=H*W
B=h*W+w*H-w*h
print(A-B)

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