Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. New Year Tree Decorations

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputDue to atheistic Soviet past, Christmas wasn't officially celebrated in Russia for most of the twentieth century. As a result, the Russian traditions for Christmas and New Year mixed into one event celebrated on the New Year but including the tree, a Santa-like 'Grandfather Frost', presents and huge family reunions and dinner parties all over the country. Bying a Tree at the New Year and installing it in the house is a tradition. Usually the whole family decorates the tree on the New Year Eve. We hope that Codeforces is a big and loving family, so in this problem we are going to decorate a tree as well.

So, our decoration consists of *n* pieces, each piece is a piece of colored paper, its border is a closed polyline of a special shape. The pieces go one by one as is shown on the picture. The *i*-th piece is a polyline that goes through points: (0, 0), (0, *y*_{0}), (1, *y*_{1}), (2, *y*_{2}), ..., (*k*, *y*_{k}), (*k*, 0). The width of each piece equals *k*.

The piece number 1 (shown red on the figure) is the outer piece (we see it completely), piece number 2 (shown yellow) follows it (we don't see it completely as it is partially closed by the first piece) and so on. The programmers are quite curious guys, so the moment we hung a decoration on the New Year tree we started to wonder: what area of each piece can people see?

Input

The first line contains two integers, *n* and *k* (1 ≤ *n*, *k* ≤ 300). Each of the following *n* lines contains *k* + 1 integers — the description of the polyline. If the *i*-th line contains ontegers *y*_{i, 0}, *y*_{i, 1}, ..., *y*_{i, k}, that means that the polyline of the *i*-th piece goes through points (0, 0), (0, *y*_{i, 0}), (1, *y*_{i, 1}), (2, *y*_{i, 2}), ..., (*k*, *y*_{i, k}), (*k*, 0) (1 ≤ *y*_{i, j} ≤ 1000).

Output

Print *n* real numbers — for each polyline, the area of its visible part.

The answer will be considered correct if its relative or absolute error do not exceed 10^{ - 4}.

Examples

Input

2 2

2 1 2

1 2 1

Output

3.000000000000

0.500000000000

Input

1 1

1 1

Output

1.000000000000

Input

4 1

2 7

7 2

5 5

6 4

Output

4.500000000000

1.250000000000

0.050000000000

0.016666666667

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/22/2017 10:16:31 (c2).

Desktop version, switch to mobile version.

User lists

Name |
---|