CF55E Very simple problem

You are given a convex polygon. Count, please, the number of triangles that contain a given point in the plane and their vertices are the vertices of the polygon. It is guaranteed, that the point doesn't lie on the sides and the diagonals of the polygon.

The first line contains integer $ n $ — the number of vertices of the polygon ( $ 3

The output should contain $ t $ integer numbers, each on a separate line, where $ i $ -th number is the answer for the $ i $ -th point. Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cin (also you may use %I64d).