You are given an array a of n integers and an integer s. It is guaranteed that n is odd.

In one operation you can either increase or decrease any single element by one. Calculate the minimum number of operations required to make the median of the array being equal to s.

The median of the array with odd length is the value of the element which is located on the middle position after the array is sorted. For example, the median of the array 6, 5, 8 is equal to 6, since if we sort this array we will get 5, 6, 8, and 6 is located on the middle position.

Input

The first line contains two integers n and s (1≤ n≤ 2⋅ 10^5-1, 1≤ s≤ 10^9) — the length of the array and the required value of median.

The second line contains n integers a_1, a_2, …, a_n (1≤ a_i ≤ 10^9) — the elements of the array a.

It is guaranteed that n is odd.

Output

In a single line output the minimum number of operations to make the median being equal to s.

Examples

Input

3 8
6 5 8


Output

2

Input

7 20
21 15 12 11 20 19 12


Output

6

Note

In the first sample, 6 can be increased twice. The array will transform to 8, 5, 8, which becomes 5, 8, 8 after sorting, hence the median is equal to 8.

In the second sample, 19 can be increased once and 15 can be increased five times. The array will become equal to 21, 20, 12, 11, 20, 20, 12. If we sort this array we get 11, 12, 12, 20, 20, 20, 21, this way the median is 20.
3 1
1 2 5
 1 1
100000
 5 1
2 2 4 6 1
 3 10
5 5 10
 1 1
1
 3 4
1 2 5
 1 100
88
 1 100
105

1
 99999
 2
 5
 0
 2
 12
 5

import java.util.*;
import java.io.*;

public class B {

	static final boolean stdin = true;
	static final String filename = "";
	static FastScanner br;
	static PrintWriter pw;

	public static void main(String[] args) throws IOException {

		if (stdin) {
			br = new FastScanner();
			pw = new PrintWriter(new OutputStreamWriter(System.out));
		} else {
			br = new FastScanner(filename + ".in");
			pw = new PrintWriter(new FileWriter(filename + ".out"));
		}

		Solver solver = new Solver();
		solver.solve(br, pw);
	}

	static class Solver {
		static long mod = 1000000000;

		public void solve(FastScanner br, PrintWriter pw) throws IOException {
			int n = br.nextInt(), s = br.nextInt();
			int[] in = new int[n];
			for (int i = 0; i < n; i++) {
				in[i] = br.nextInt();
			}
			Arrays.sort(in);
			int mid = n / 2;
			long tot = 0;
			for(int i = mid; i < n; i++){
				if(in[i] < s){
					tot += s-in[i];
				}
			}
			pw.println(tot);
			pw.close();

		}

		static long gcd(long a, long b) {
			if (a > b)
				return gcd(b, a);
			if (a == 0)
				return b;
			return gcd(b % a, a);
		}

		static long pow(long a, long b) {
			if (b == 0)
				return 1L;
			long val = pow(a, b / 2);
			if (b % 2 == 0)
				return val * val % mod;
			else
				return val * val % mod * a % mod;
		}

	}

	static class Point1 implements Comparable<Point1> {
		int a;
		int b;

		Point1(int a, int b) {
			this.a = a;
			this.b = b;
		}

		@Override
		public int compareTo(Point1 o) {
			return this.a - o.a;
		}

	}

	static class Point2 implements Comparable<Point2> {
		int a;
		int b;

		Point2(int a, int b) {
			this.a = a;
			this.b = b;
		}

		@Override
		public int compareTo(Point2 o) {
			return this.b - o.b;
		}

	}

	static class UnionFind {
		// The number of elements in this union find
		private int size;
		// Used to track the size of each of the component
		private int[] sz;
		// id[i] points to the parent of i, if id[i] = i then i is a root node
		private int[] id;
		// Tracks the number of components in the union find
		private int numComponents;

		public UnionFind(int size) {
			if (size <= 0)
				throw new IllegalArgumentException("Size <= 0 is not allowed");
			this.size = numComponents = size;
			sz = new int[size];
			id = new int[size];
			for (int i = 0; i < size; i++) {
				id[i] = i; // Link to itself (self root)
				sz[i] = 1; // Each component is originally of size one
			}
		}

		// Find which component/set 'p' belongs to in amortized constant time.
		public int find(int p) {
			// Find the root of the component/set
			int root = p;
			while (root != id[root])
				root = id[root];
			// Compress the path leading back to the root.
			// Doing this operation is called "path compression"
			// and is what gives us amortized time complexity.
			while (p != root) {
				int next = id[p];
				id[p] = root;
				p = next;
			}
			return root;
		}

		// This is an alternative recursive formulation for the find method
		// public int find(int p) {
		// if (p == id[p]) return p;
		// return id[p] = find(id[p]);
		// }

		// Return whether or not the elements 'p' and
		// 'q' are in the same components/set.
		public boolean connected(int p, int q) {
			return find(p) == find(q);
		}

		// Return the size of the components/set 'p' belongs to
		public int componentSize(int p) {
			return sz[find(p)];
		}

		// Return the number of elements in this UnionFind/Disjoint set
		public int size() {
			return size;
		}

		// Returns the number of remaining components/sets
		public int components() {
			return numComponents;
		}

		// Unify the components/sets containing elements 'p' and 'q'
		public void unify(int p, int q) {
			int root1 = find(p);
			int root2 = find(q);
			// These elements are already in the same group!
			if (root1 == root2)
				return;
			// Merge smaller component/set into the larger one.
			if (sz[root1] < sz[root2]) {
				sz[root2] += sz[root1];
				id[root1] = root2;
			} else {
				sz[root1] += sz[root2];
				id[root2] = root1;
			}
			// Since the roots found are different we know that the
			// number of components/sets has decreased by one
			numComponents--;
		}
	}

	public static class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner(String s) {
			try {
				br = new BufferedReader(new FileReader(s));
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
		}

		public FastScanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String nextToken() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(nextToken());
		}

		long nextLong() {
			return Long.parseLong(nextToken());
		}

		double nextDouble() {
			return Double.parseDouble(nextToken());
		}

		ArrayList<Integer>[] nextGraph(int nodes, int edges) {
			ArrayList<Integer>[] adj = new ArrayList[nodes];
			for (int i = 0; i < nodes; i++) {
				adj[i] = new ArrayList<Integer>();
			}
			for (int i = 0; i < edges; i++) {
				int a = nextInt() - 1;
				int b = nextInt() - 1;
				adj[a].add(b);
				adj[b].add(a);
			}
			return adj;
		}
	}
}