1 2
9
 7 6
4 20 16 14 3 17 4
 1 1
1000000000
 4 2
45 44 35 38
 2 1
4 1000000000
 2 1
1 4
 100 10
246 286 693 607 87 612 909 312 621 37 801 558 504 914 416 762 187 974 976 123 635 488 416 659 988 998 93 662 92 749 889 78 214 786 735 625 921 372 713 617 975 119 402 411 878 138 548 905 802 762 940 336 529 373 745 835 805 880 816 94 166 114 475 699 974 462 61 337 555 805 968 815 392 746 591 558 740 380 668 29 881 151 387 986 174 923 541 520 998 947 535 651 103 584 664 854 180 852 726 93
 3 3
1 5 20
 2 2
7 14
 9 30111088
824713578 11195876 458715185 731769293 680826358 189542586 550198537 860586039 101083021
 5 1
23 8 83 26 18
 3 1
4 8 16
 50 100
74 55 33 5 83 24 75 59 30 36 13 4 62 28 96 17 6 35 45 53 33 11 37 93 34 79 61 72 13 31 44 75 7 3 63 46 18 16 44 89 62 25 32 12 38 55 75 56 61 82
 9 1
1 2 4 9 15 32 64 128 1024
 2 5
10 11
 3 1
1 3 6
 3 19905705
263637263 417905394 108361057
 4 1
88 55 14 39
 3 1
4 5 6
 1 1
4
 3 2
4 9 18
 2 2
3 6
 1 1
20
 2 60669400
95037700 337255240
 29 2
1 3 7 15 31 63 127 255 511 1023 2047 4095 8191 16383 32767 65535 131071 262143 524287 1048575 2097151 4194303 8388607 16777215 33554431 67108863 134217727 268435455 536870911
 5 1
100 200 400 1000 2000
 2 10
21 42
 5 3
6 6 6 13 27
 3 1
1 4 6
 2 1
3 6
 1 1
3
 2 2
2 8
 1 1000000000
1
 4 1
2 4 8 32
 4 28
34 1 86 90
 4 25
100 11 1 13
 3 6
13 26 52
 3 3
1 7 13
 3 1
2 3 6
 2 1
3 5
 2 1
2 3
 2 2
8 16
 10 295206008
67980321 440051990 883040288 135744260 96431758 242465794 576630162 972797687 356406646 547451696
 5 3
1024 4096 16384 65536 536870913
 1 4
9
 2 1
5 10
 2 1
1 1000000000
 3 165219745
737649884 652879952 506420386
 3 72014068
430005292 807436976 828082746
 3 1
3 6 9
 2 2
8 11
 5 2
86 81 53 25 18
 1 1
2
 2 1
4 8
 3 2
4 5 6

2 1 29 4 28 1 1 1 1 2 4 1 0 4 0 1 3 4 1 1 1 0 4 1 27 7 1 2 1 1 1 1 0 1 1 1 1 1 0 1 0 1 0 24 1 2 29 1 2 1 1 4 0 1 0
import java.io.*;


         
            import java.math.BigInteger;
        import java.text.DecimalFormat;
        import java.util.*;


        
             public class Main {
            	public static InputReader in;
                public static PrintWriter pw;
             
             
             
            	public static void main(String args[]) 
            	{
            		new Thread(null, new Runnable() {
                        public void run() {
                            try{
                                solve();
                            }
                            catch(Exception e){
                                e.printStackTrace();
                            }
                        }
                    }, "1", 1 << 26).start();
                }
            	static ArrayList<Integer> g[];
            	static ArrayList<Integer> h[];
            	static boolean visited[];
            	static int[] parent;
            	static int par[];
            	static int degree[];
            	static int edjes=0;
            	static int start=-1;
            	static int end=-1;
            	static int Total=0;
            	static int time1[];
            	static int time2[];
            	static int glob=0;
            	static int[] ans;
            	static boolean vis2[][];
            	//static long sum1=0;
            	//static long val[];
                static ArrayList<Integer> levels[];
                static int max=0;
                static int lev=1;
                static ArrayList<Integer> nodes[];
                static ArrayList<Integer> values[];
                static int depth[];
                static boolean found=false;
               // static long sm[];
                static int sum1=0;
                static int pre[][];
                static int subtree[];
               static  int cnt=0;
               static  HashMap<String,Integer> hm;
               static int sm[];
               static int size[];
               static long mul[];
               static long d[]=new long[1000000];
               static int tot=0;
               static long highest=(long)1e9;
               static boolean bit=false;
                static Stack<Integer> tt=new Stack();
               static HashSet<Character> set;
         	   static long fact[],num[];
         	   static long MOD=1000000007;
         	   static int value[];static int premen[];
         	   static int count=0,index=0;
         	   static double ans11[];
         	   static int price[];
         	   static ArrayList<String> hp[][];
         	   static boolean visit[][];
         	   static int cnu[]=new int[1000001];
         	   static int label=1;
         	   static int his[][];
         	   static int size1=0;
         	   static int up[],down[];
         	   static int TotalUp=0;
         	   static long dist[];
         	//   static HashMap<String,Integer> hm1=new HashMap();
         	  // static HashMap<Integer,Integer> hm2=new HashMap();
         	   static TreeSet<Long> set1=new TreeSet();
         	  static  long DP[][][]=new long[20][200][1500];
         	 	static int t=-1,n=-1;
         	 	static int two[],min[],r[];
         	 	static int total[];static int black[];
         	 	static int Parent[];
         	 	static int max2[];
         	// 	static int tin[],tout[],a[];
         	 public static void solve() throws FileNotFoundException{
            		
            	
            		 in = new InputReader(System.in);
            		 pw = new PrintWriter(System.out);  
                     int n=in.nextInt();
                     int k=in.nextInt();
                     int a[]=in.nextIntArray(n);
                     Arrays.sort(a);
                     int now=2*k;
                     int ans=0;
                     for(int i=0;i<n;i++)
                     {
                    	 while(a[i]>now)
                    	 {
                    		 ans++;
                    		 now*=2;
                    	 }
                    	 now=Math.max(now,2*a[i]);
                     }
                     System.out.println(ans);
         	 
         	 
         	 } 
         	 
         	 
         	 
                  	 public static int search(int l,int h,int a[],int key)
         	 {
         		 if(l>h)
         			 return -1;
         		 int mid=(l+h)/2;
         		 if(key==a[mid])
         		 {
         			 return mid;
         		 }
         		 if(a[l]<=a[mid])
         		 {
         			 if(key>=a[l]&&key<=a[mid])
         				 return search(l,mid-1,a,key);
         			 return search(mid+1,h,a,key);
         		 }
         		 if(key>=a[mid]&&key<=a[h])
         			 return search(mid+1,h,a,key);
         		 return search(l,mid-1,a,key);
         	 }
         	 public static boolean check(int a[][],int b[][],int n,int m)
         	 {
         		for(int k=0;k<n;k++)
    			{
    				for(int l=0;l<m;l++)
    				{
    					if(a[k][l]!=b[k][l])
    					{
    						return false;
    						//break;
    					}
    				}
    			}
         		return true;
         	 }
        
            
          		public static void bfs(int x)
         	 {
         		 visited[x]=true;
         		 Queue<Integer> Q=new LinkedList<Integer>();
         		 Q.add(x);
         		 while(!Q.isEmpty())
         		 {
         			 int count=Q.size();
         			 while(count>0)
         			 {
         				 int p=Q.poll();
         				 visited[p]=true;
         				 for(int y:g[p])
         				 {
         					 if(!visited[y])
         					 {
         						 Q.add(y);
         					 }
         				 }
         				 count--;
         			 }
         		 }
         	 }
         	 public static void depth(int curr,int parent)
         	 {
         		 visited[curr]=true;
         		 for(int x:g[curr])
         		 {
         			 if(!visited[x])
         			 {
         				 depth[x]=depth[curr]+1;
         				 depth(x,curr);
         			 }
         		 }
         	 }
         	
         	 static int Par[]=new int[202];
         	 public static void Height(int cur,int par){
         		 Par[cur]=par;
         		 visited[cur]=true;
         		 int t=0;
         		 for(int x:g[cur])
         		 {
         			 if(!visited[x])
         			 { 
         				 t++;
         				 Height(x,cur);
         				 high[cur]=Math.max(high[cur], high[x]+1);
         			 }
         		 }
         		 if(t==0)
         		 {
         			 high[cur]=0;
         		 }
         	
         	 }
         	 static int dia[]=new int[202];
         	 static int high[]=new int[292];
         	 public static void Diameter(int curr,int parent)
         	 {
         		visited[curr]=true;
         		int trees=0;
         		ArrayList<Integer> set=new ArrayList();
         	
         		for(int x:g[curr])
         		{
         			if(!visited[x])
         			{
         				trees++;
         				Diameter(x,curr);
         				dia[curr]=Math.max(dia[curr],high[x]);
         				set.add(high[x]);
         			}
         		}
         		if(set.size()>=2)
         		{
         			Collections.sort(set,Collections.reverseOrder());
         			dia[curr]=Math.max(dia[curr],set.get(0)+set.get(1)+2);
         		}
         		else if(set.size()>0)
         		{
         			dia[curr]=Math.max(dia[curr],set.get(0)+1);
         		}
         		if(trees==0)
         		{
         			dia[curr]=0;
         		}
         
         	 }
         	 
              	 
         	 public static boolean IsPal(String s)
         	 {
         		 char c[]=s.toCharArray();
         		 for(int i=0;i<c.length/2;i++)
         		 {
         			 if(c[i]!=c[s.length()-1-i])
         				 return false;
         		 }
         		 return true;
         	 }
         	public static void Merge(long[] a,int p,int r){
                if(p<r){
                    int q = (p+r)/2;
                    Merge(a,p,q);
                    Merge(a,q+1,r);
                    Merge_Array(a,p,q,r);
                }
            }
            public static void Merge_Array(long a[],int p,int q,int r){
               long b[] = new long[q-p+1];
                long c[] = new long[r-q];
                for(int i=0;i<b.length;i++)
                    b[i] = a[p+i];
                for(int i=0;i<c.length;i++)
                    c[i] = a[q+i+1];
                int i = 0,j = 0;
                for(int k=p;k<=r;k++){
                    if(i==b.length){
                        a[k] = c[j];
                        j++;
                    }
                    else if(j==c.length){
                        a[k] = b[i];
                        i++;
                    }
                    else if(b[i]<c[j]){
                        a[k] = b[i];
                        i++;
                    }
                    else{
                        a[k] = c[j];
                        j++;
                    }
                }
            }
         	 
         	 
         	 
         	
         	
               
         	  public static void dfs1(int curr,int parent)
         	  {
         		  visited[curr]=true;
         		  
         		  for(int x:g[curr])
         		  {
         			  
         			  if(x==parent)continue;
         			  depth[x]=depth[curr]+1;
         			  up[x]=up[curr];
         			  if(h[x].contains(curr)){
         				  up[x]++;
         				  TotalUp++;
         			  }
         			  dfs1(x,curr);
         		  }
         	  }
         	 
                
                
                public static void dfs(int curr,int Parent)
                {
                	visited[curr]=true;
                	size[curr]=1;
                	parent[curr]=Parent;
                	count++;
                	if(value[curr]>0)
                	{
                		index=value[curr];
                	}
                	for(int x:g[curr])
                	{
                		if(!visited[x])
                		{
                			dfs(x,curr);
                			size[curr]+=size[x];
                		}
                	}
                }
                static long ncr(long a, long b){
        			if(b>a || b<0) return 0;
        			long f = (fact[(int) a]*modInverse(((fact[(int) b]*fact[(int) (a-b)])%MOD), MOD))%MOD;
        			return f;
        		}
        		static long modInverse(long a, long mOD2){
                    return  power(a, mOD2-2, mOD2);
        }
        static long power(long x, long y, long m)
        {
            if (y == 0)
                return 1;
            long p = power(x, y/2, m) % m;
            p = (p * p) % m;
         
            return (y%2 == 0)? p : (x * p) % m;
        }
         
                public static long gcd(long x, long y) {
            		if (x == 0)
            			return y;
            		else
            			return gcd( y % x,x);
            	}	
                public static long power(long a,long b)
        		{
        			long result=1;
        			while(b>0)
        			{
        				if(b%2==1)
        					result*=a;
        				a=a*a;
        				b/=2;
        			}
        			return result;
        		}
                static class Pair implements Comparable<Pair>{
                	    int t;int d;int s;
                		Pair(int val,int index,int hum){
                	     	this.t=val;this.d=index;
                	     	this.s=hum;
                		}
                		@Override
                		public int compareTo(Pair o) {
                                
                                	return o.s-s;
                		}
                				
                	}
            	static class InputReader {
             
            		private InputStream stream;
            		private byte[] buf = new byte[8192];
            		private int curChar, snumChars;
            		private SpaceCharFilter filter;
             
            		public InputReader(InputStream stream) {
            			this.stream = stream;
            		}
             
            		public int snext() {
            			if (snumChars == -1)
            				throw new InputMismatchException();
            			if (curChar >= snumChars) {
            				curChar = 0;
            				try {
            					snumChars = stream.read(buf);
            				} catch (IOException e) {
            					throw new InputMismatchException();
            				}
            				if (snumChars <= 0)
            					return -1;
            			}
            			return buf[curChar++];
            		}
             
            		public   int nextInt() {
            			int c = snext();
            			while (isSpaceChar(c))
            				c = snext();
            			int sgn = 1;
            			if (c == '-') {
            				sgn = -1;
            				c = snext();
            			}
            			int res = 0;
            			do {
            				if (c < '0' || c > '9')
            					throw new InputMismatchException();
            				res *= 10;
            				res += c - '0';
            				c = snext();
            			} while (!isSpaceChar(c));
            			return res * sgn;
            		}
             
            		public long nextLong() {
            			int c = snext();
            			while (isSpaceChar(c))
            				c = snext();
            			int sgn = 1;
            			if (c == '-') {
            				sgn = -1;
            				c = snext();
            			}
            			long res = 0;
            			do {
            				if (c < '0' || c > '9')
            					throw new InputMismatchException();
            				res *= 10;
            				res += c - '0';
            				c = snext();
            			} while (!isSpaceChar(c));
            			return res * sgn;
            		}
             
            		public int[] nextIntArray(int n) {
            			int a[] = new int[n];
            			for (int i = 0; i < n; i++)
            				a[i] = nextInt();
            			return a;
            		}
             
            		public String readString() {
            			int c = snext();
            			while (isSpaceChar(c))
            				c = snext();
            			StringBuilder res = new StringBuilder();
            			do {
            				res.appendCodePoint(c);
            				c = snext();
            			} while (!isSpaceChar(c));
            			return res.toString();
            		}
             
            		public boolean isSpaceChar(int c) {
            			if (filter != null)
            				return filter.isSpaceChar(c);
            			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
            		}
             
            		public interface SpaceCharFilter {
            			public boolean isSpaceChar(int ch);
            		}
            	}
            }
          