We've got no test cases. A big olympiad is coming up. But the problemsetters' number one priority should be adding another problem to the round.

The diameter of a multiset of points on the line is the largest distance between two points from this set. For example, the diameter of the multiset {1, 3, 2, 1} is 2.

Diameter of multiset consisting of one point is 0.

You are given n points on the line. What is the minimum number of points you have to remove, so that the diameter of the multiset of the remaining points will not exceed d?

Input

The first line contains two integers n and d (1 ≤ n ≤ 100, 0 ≤ d ≤ 100) — the amount of points and the maximum allowed diameter respectively.

The second line contains n space separated integers (1 ≤ xi ≤ 100) — the coordinates of the points.

Output

Output a single integer — the minimum number of points you have to remove.

Examples

Input

3 1
2 1 4


Output

1


Input

3 0
7 7 7


Output

0


Input

6 3
1 3 4 6 9 10


Output

3

Note

In the first test case the optimal strategy is to remove the point with coordinate 4. The remaining points will have coordinates 1 and 2, so the diameter will be equal to 2 - 1 = 1.

In the second test case the diameter is equal to 0, so its is unnecessary to remove any points. 

In the third test case the optimal strategy is to remove points with coordinates 1, 9 and 10. The remaining points will have coordinates 3, 4 and 6, so the diameter will be equal to 6 - 3 = 3.
	import java.awt.List;
		    		import java.io.*;
		import java.math.BigInteger;
		import java.util.*;
		
		    		
		    		
		    		/*
		    		 * 
		    		 * daiict
		    		 *
		    		 * 
		    		 * 
		    		 */
		    		
		    		
		    		public class pprac {
		    			 FastScanner in;
		    			 PrintWriter out;
		    		
		    			static ArrayList[] adj;
		    			static ArrayList[] aadj;
		    		    static int last;
		    			static int n;
		    			static int m;
		    			
		    			static int[] dp1;
		    			static int[] dp2;
		    			static int color[];
		    			static int visited[];
		    			static int[] arr;
		    			static long[] brr;
		    			static double ans;
		    			static int array[];
		    			static int start[];
		    			static int finish[];
		    			static int pref[];
		    			static int tree[];
		    			static int maxval = 32;
		    		
		    			static int ttt[];
		    			static int sum = 0;
		    			static String s;
		    		
		    			static int cc = 0;
		    			static long min = Long.MAX_VALUE;
		    			
		    			static ArrayList<Integer> segt[];
		    			
		    		//for dfs do not delete
		    			static int dir[][] ={{1,0},{0,1},{0,-1},{-1,0}};
		    			
		    		
		    			static int[] seg;
		    			static long count = 1;
		    			static long mod = (long)1e9 + 7;
		    	
		    			static int parent[];
		    			static int size[];
		    			
		    		    static int[] l;
		    		    static int[] r;
		    		    static int[] next;
		    		    static int[] cnt;
		    		    static int[] block;
		    		    
		    			static HashSet<String> set;
		    			static HashSet<String> set2;
		    			
		    			static int low[];
		    			static int disc[];
		    			static int time;
		    			static int acn[];
		    			
		    			static class Pair implements Comparable<Pair>
		    		    {
		    				int x;int y;
		    				
		    		        Pair(int l, int m) {
		    		          
		    		        	this.x = l;
		    		            this.y = m;
		    		          
		    		        }
		    		        
		    		        public int compareTo(Pair p) {
		    		      
		    		        	
		    		            if (this.x == p.x) {
		    		                return (int)(this.y-p.y);
		    		            }
		    		            return (int)(this.x - p.x);
		    		        }
		    		        
		    		        public String toString(){
		    		        	return x + " " + y;
		    		        }
		    		        
		    		        public boolean equals(Object o){
		    		        	if(o instanceof Pair){
		    		        		Pair a = (Pair)o;
		    		        		
		    		        		return this.x == a.x;
		    		        	}
		    		        	
		    		        	return false;
		    		        }
		    		        
		    		        public int hashCode(){
		    		        	return new Long(x).hashCode()*31 + new Long(y).hashCode();
		    		        }
		    		    
		    		    }
		    		    
		    			
		    			public static int gcd(int a, int b) {
		    				if (b == 0) return a;
		    				return gcd(b, a%b);
		    			}
		    	
		    			void build(int n) {  // build the tree
		  				  for (int i = n - 1; i > 0; --i) seg[i] = seg[i<<1]+seg[i<<1|1];
		  				}
	
		  			public static void modify(int p, int val,int n) {  // set value at position p
		  				  for (seg[p += n] = val; p > 1; p >>= 1) seg[p>>1] = seg[p] + seg[p^1];
		  				}
	
		  				int query(int l, int r,int n) {  // sum on interval [l, r)
		  				  int res = 0;
		  				  for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
		  				    if ((l&1) == 1) res += seg[l++];
		  				    if ((r&1) == 1) res += seg[--r];
		  				  }
		  				  return res;
		  				}
		    				
//		    			public static void update(int x,int val){
//		    				while(x<=maxval){
//		    					tree[x] += val;
//		    					x = (x&-x);
//		    				}
//		    			}
		    			
		    			public static int read(int idx){
		    				int sum = 0;
		    				
		    				while(idx>= 0){
		    					sum += tree[idx];
		    					idx -= (idx&(-idx));
		    				}
		    				
		    				return sum;
		    			}
		    			
		    			public static int find(int i){
		    				if(parent[i] != i){
		    					return find(parent[i]);
		    				}
		    				
		    				return i;
		    			}
		    			
		    			public static void union(int a,int b){
		    				int x = find(a);
		    				int y = find(b);
		    				
		    				if(x!=y){
		    					if(size[x] > size[y]){
		    						size[x] += size[y];
		    						parent[y] = x;
		    					}else{
		    						size[y] += size[x];
		    						parent[x] = y;
		    				}
		    				}
		    			}
		    			
		    			
		    			
		    			
		    			
		    		    /*static */ void solve() throws NumberFormatException,InputMismatchException, IOException {
		    		    
		    		 //   	Scanner in = new Scanner(System.in);
		    		   
		    		    	int n = in.nextInt();
		    		    	int d = in.nextInt();
		    		    	
		    		    	int arr[] = new int[n];
		    		    	int max = 0;
		    		    	for(int i = 0;i<n;i++){
		    		    		arr[i] = in.nextInt();
		    		    	}
		    		    	
		    		    	Arrays.sort(arr);
		    		    	//out.println("s");
		    		    	int min = Integer.MAX_VALUE;
		    		    	for(int i = 0;i<n;i++){
		    		    		int s = i;
		    		    		
		    		    		int dd= arr[i]+d;
		    		    		
		    		    		for(int j = i;j<n;j++){
		    		    			if(arr[j] > dd){
		    		    				s++;
		    		    			}
		    		    		}
		    		    		
		    		    		min = Math.min(min, s);		    		    		
		    		    	}
		    		    
		    		    	out.println(min);
		    		    }
		    		    
		    		    public static void uu(int arr[],int i,int f){
		    		    	if(i == 1){
		    		    		return;
		    		    	}
		    		    	int next = i/2;
		    		    	int x = 0;
		    		    	if(i%2 == 0){
		    		    		x = i+1;
		    		    	}else{
		    		    		x = i-1;
		    		    	}
		    		    	
		    		    	if(f == 1){
		    		    		arr[next] = arr[i] ^ arr[x];
		    		    	}else{
		    		    		arr[next] = arr[i]|arr[x];
		    		    	}
		    		    	
		    		    	uu(arr,next,1-f);
		    		    }
		    		    
		    		   
			    
		    		   
		    		  
		    		
		    		    public static String reverse(String s){
		    		    	
		    		    	String ans = "";
		    		    	
		    		    	for(int i = s.length()-1;i>=0;i--){
		    		    		ans += s.charAt(i);
		    		    	}
		    		    	
		    		    	return ans;
		    		    	
		    		    }
		    			
		    			
		    		    
		    		 
		    		    public static long sum(long x){
		    		    	return x<10?x:x%10 + sum(x/10);
		    		    }
		    			
		    			public static long gcd(long x, long y) {
		    				if (x == 0)
		    					return y;
		    				else
		    					return gcd( y % x,x);
		    			}
		    			static long inv(long x , long mod)
		    			{
		    				long r,y;
		    				for(r=1,y=mod-2;y!=0;x=x*x%mod,y>>=1)
		    				{
		    					if((y&1)==1)
		    						r=r*x%mod;
		    				
		    				}
		    				return r;
		    			}
		    			
		    			public static long pow(long x,long y,long n){
		    				if(y==0)
		    					return 1%n;
		    				if(y%2==0){
		    					long z=pow(x,y/2,n);
		    					return (z*z)%n;
		    				}
		    				return ((x%n)*pow(x,y-1,n))%n;
		    			}
		    			
		    			
		    			
		    			
		    			public static boolean isPrime(long a) {
		    				// Corner cases
		    				if (a <= 1)
		    					return false;
		    				if (a <= 3)
		    					return true;
		    		 
		    				// This is checked so that we can skip 
		    				// middle five numbers in below loop
		    				if (a % 2 == 0 || a % 3 == 0)
		    					return false;
		    		 
		    				for (long i = 5; i * i <= a; i = i + 6)
		    					if (a % i == 0 || a % (i + 2) == 0)
		    						return false;
		    		 
		    				return true;
		    			}
		    			
		    		
		    			void run() throws NumberFormatException, InputMismatchException,IOException {
		    				in = new FastScanner();
		    				out = new PrintWriter(System.out);
		    		
		    				solve();
		    		
		    				out.close();
		    			}
		    		
		    			class FastScanner {
		    				BufferedReader br;
		    				StringTokenizer st;
		    		
		    				public FastScanner() {
		    					br = new BufferedReader(new InputStreamReader(System.in));
		    				}
		    		
		    				String next() {
		    					while (st == null || !st.hasMoreTokens()) {
		    						try {
		    							st = new StringTokenizer(in.br.readLine());
		    						} catch (IOException e) {
		    							// TODO Auto-generated catch block
		    							e.printStackTrace();
		    						}
		    					}
		    					return st.nextToken();
		    				}
		    		
		    				int nextInt() {
		    					return Integer.parseInt(next());
		    				}
		    		
		    				long nextLong() {
		    					return Long.parseLong(next());
		    				}
		    		
		    				double nextDouble() {
		    					return Double.parseDouble(next());
		    				}
		    			}
		    			
		    			
		    			
		    			
		    		 
		    		
		    			public static void main(String[] args) throws NumberFormatException,InputMismatchException, IOException {
//		    				 new Thread(null ,new Runnable(){
//		    				       public void run(){
//		    				           try{
//		    				        		
//		    				               test();
//
//		    				           } catch(Exception e){
//		    				               e.printStackTrace();
//		    				           }
//		    				       }
//		    				   },"1",1<<26).start();
//		    				   	   }
//		    				    static StringBuilder sb;
//		    				    public static void test() throws IOException{
//		    				    	 sb=new StringBuilder();
//		    				    	int t=1;
//		    				    	while(t-->0){
//		    				    		
//		    				    		solve();
//		    				    		
//		    				    	}
//		    				    	

	    				    new pprac().run();
		    			}
		    				    
		    			
		    		}
		    		class Node{
		    			int a;
		    			int b;
		    			public Node(int i, int j) {
							this.a = i;
							this.b = j;
							
						}
					
		    			
		    		}
		    		
		    		class MyComp implements Comparator<String>{
		    		    
		    			int c = 0;
		    			
		    			MyComp(int d){
		    				c = d;
		    			}
		    			
		    			@Override
		    			public int compare(String a,String b) {
		    				
		    				// < == -1
		    				
		    				String arr[] = a.split(" ");
		    				String brr[] = b.split(" ");
		    				
		    				return arr[c].compareTo(brr[c]);
		    				
		    				
		    			}
		
		    			
		    		}
		    		
		    		class MyComp2 implements Comparator<Node>{
		    		    
		    		
		    			
		    			@Override
		    			public int compare(Node a,Node b) {
		    				
		    				// < == -1
		
		    				
		    				if(a.b > b.b){
		    					return -1;
		    				}else{
		    					return 1;
		    				}
		    				
		    				
		    			}
		
		    			
		    		}