Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

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

A. Wasted Time

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputMr. Scrooge, a very busy man, decided to count the time he wastes on all sorts of useless stuff to evaluate the lost profit. He has already counted the time he wastes sleeping and eating. And now Mr. Scrooge wants to count the time he has wasted signing papers.

Mr. Scrooge's signature can be represented as a polyline *A*_{1}*A*_{2}... *A*_{n}. Scrooge signs like that: first it places a pen at the point *A*_{1}, then draws a segment from point *A*_{1} to point *A*_{2}, then he draws a segment from point *A*_{2} to point *A*_{3} and so on to point *A*_{n}, where he stops signing and takes the pen off the paper. At that the resulting line can intersect with itself and partially repeat itself but Scrooge pays no attention to it and never changes his signing style. As Scrooge makes the signature, he never takes the pen off the paper and his writing speed is constant — 50 millimeters per second.

Scrooge signed exactly *k* papers throughout his life and all those signatures look the same.

Find the total time Scrooge wasted signing the papers.

Input

The first line contains two integers *n* and *k* (2 ≤ *n* ≤ 100, 1 ≤ *k* ≤ 1000). Each of the following *n* lines contains the coordinates of the polyline's endpoints. The *i*-th one contains coordinates of the point *A*_{i} — integers *x*_{i} and *y*_{i}, separated by a space.

All points *A*_{i} are different. The absolute value of all coordinates does not exceed 20. The coordinates are measured in millimeters.

Output

Print one real number — the total time Scrooges wastes on signing the papers in seconds. The absolute or relative error should not exceed 10^{ - 6}.

Examples

Input

2 1

0 0

10 0

Output

0.200000000

Input

5 10

3 1

-5 6

-2 -1

3 2

10 0

Output

6.032163204

Input

6 10

5 0

4 0

6 0

3 0

7 0

2 0

Output

3.000000000

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/25/2017 05:11:15 (p1).

Desktop version, switch to mobile version.

User lists

Name |
---|