Time limit per test: 5 seconds Memory limit: 64 megabytes
input: standard output: standard
In
the game 'Heroes of keyboard and mouse' there are some cities at the
plane; each city is situated in a point. The player can build some new
cities. All the cities are surrounded by a polygonal wall of minimal
length. When a city is built, the wall may be rebuilt to include it.
Your task is to determine the area inside the wall each time a new city
is built. Of course, the cities are in distinct points.
Input
The game starts with three cities with coordinates , and ,
which are given in the first line of the input. The initial area inside
the wall is non-negative. The second line of the input contains single
integer (), being the number of cities to be built. Each of the next lines contains the coordinates of a city to be built. All the coordinates are integer and do not exceed by absolute value.
Output
The -th line of the output () must contain an integer, being the doubled area inside the wall after building first cities (as listed in the input, not including the first three).