Problem: Mr. 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 A1A2... An. Scrooge signs like that: first it places a pen at the point A1, then draws a segment from point A1 to point A2, then he draws a segment from point A2 to point A3 and so on to point An, 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 Ai — integers xi and yi, separated by a space.

All points Ai 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

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
/**
 * ecnuacm
 * Main.java
 */
public class Main {

	/**
	 * @param args
	 */
	boolean[] isprime = new boolean[1005];
	int[] prime = new int[1005];
	int pn;
	int[] cnt = new int[1005];
	
	
	void init(){
		int n = 1000;
		for(int i=1;i<=n;i++){
			isprime[i] = true;
			cnt[i] = 0;
		}
		pn = 0;
		isprime[0] = isprime[1] = false;
		for(int i=2;i<=n;i++){
			if(isprime[i] == true){
				prime[pn++] = i;
				for(int j=2;i*j<=n;j++){
					isprime[i*j] = false;
				}
			}
		}
		for(int i=pn-1;i>=1;i--){
			prime[i]+=prime[i-1]+1; 
			if(prime[i]<=n)cnt[prime[i]] = 1;
		}
		for(int i=1;i<=n;i++){
			cnt[i] += cnt[i-1];
		}
	}
	/*
	public static void main(String[] args) {
		// TODO Auto-generated method stub
	    Scanner cin = new Scanner(System.in);
		int n, k;
		Main m = new Main();
		m.init();
		while(cin.hasNextInt())
		{
		    n = cin.nextInt();
		    k = cin.nextInt();
			System.out.println(m.cnt[n]);
		    if(m.cnt[n] >= k){
		    	System.out.println("YES");
		    }
		    else {
		    	System.out.println("NO");
		    }
		    //System.out.println(a + b);
		}
	}
	*/
	public static void main(String[] args){
		double dist;
		int n,k,a,b;
		Scanner cin = new Scanner(System.in);
		n = cin.nextInt();
		k = cin.nextInt();
		a = cin.nextInt();
		b = cin.nextInt();
		dist = 0;
		for(int i=0;i<n-1;i++){
			int aa = cin.nextInt();
			int bb = cin.nextInt();
			dist += Math.sqrt(Math.pow(aa-a, 2)+Math.pow(bb-b, 2));
			a = aa;
			b = bb;
		}
		dist = dist*k/50;
		System.out.println(dist);
	}
}