Codeforces Round 428 (Div. 2) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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.

brute force

graphs

math

meet-in-the-middle

*2700

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Mother of Dragons

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThere are *n* castles in the Lannister's Kingdom and some walls connect two castles, no two castles are connected by more than one wall, no wall connects a castle to itself.

Sir Jaime Lannister has discovered that Daenerys Targaryen is going to attack his kingdom soon. Therefore he wants to defend his kingdom. He has *k* liters of a strange liquid. He wants to distribute that liquid among the castles, so each castle may contain some liquid (possibly zero or non-integer number of liters). After that the stability of a wall is defined as follows: if the wall connects two castles *a* and *b*, and they contain *x* and *y* liters of that liquid, respectively, then the strength of that wall is *x*·*y*.

Your task is to print the maximum possible sum of stabilities of the walls that Sir Jaime Lannister can achieve.

Input

The first line of the input contains two integers *n* and *k* (1 ≤ *n* ≤ 40, 1 ≤ *k* ≤ 1000).

Then *n* lines follows. The *i*-th of these lines contains *n* integers *a*_{i, 1}, *a*_{i, 2}, ..., *a*_{i, n} (). If castles *i* and *j* are connected by a wall, then *a*_{i, j} = 1. Otherwise it is equal to 0.

It is guaranteed that *a*_{i, j} = *a*_{j, i} and *a*_{i, i} = 0 for all 1 ≤ *i*, *j* ≤ *n*.

Output

Print the maximum possible sum of stabilities of the walls that Sir Jaime Lannister can achieve.

Your answer will be considered correct if its absolute or relative error does not exceed 10^{ - 6}.

Namely: let's assume that your answer is *a*, and the answer of the jury is *b*. The checker program will consider your answer correct, if .

Examples

Input

3 1

0 1 0

1 0 0

0 0 0

Output

0.250000000000

Input

4 4

0 1 0 1

1 0 1 0

0 1 0 1

1 0 1 0

Output

4.000000000000

Note

In the first sample, we can assign 0.5, 0.5, 0 liters of liquid to castles 1, 2, 3, respectively, to get the maximum sum (0.25).

In the second sample, we can assign 1.0, 1.0, 1.0, 1.0 liters of liquid to castles 1, 2, 3, 4, respectively, to get the maximum sum (4.0)

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/25/2024 03:30:50 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|