Nastya received a gift on New Year — a magic wardrobe. It is magic because in the end of each month the number of dresses in it doubles (i.e. the number of dresses becomes twice as large as it is in the beginning of the month).

Unfortunately, right after the doubling the wardrobe eats one of the dresses (if any) with the 50% probability. It happens every month except the last one in the year. 

Nastya owns x dresses now, so she became interested in the [expected number](https://en.wikipedia.org/wiki/Expected_value) of dresses she will have in one year. Nastya lives in Byteland, so the year lasts for k + 1 months.

Nastya is really busy, so she wants you to solve this problem. You are the programmer, after all. Also, you should find the answer modulo 109 + 7, because it is easy to see that it is always integer.

Input

The only line contains two integers x and k (0 ≤ x, k ≤ 1018), where x is the initial number of dresses and k + 1 is the number of months in a year in Byteland.

Output

In the only line print a single integer — the expected number of dresses Nastya will own one year later modulo 109 + 7.

Examples

Input

2 0


Output

4


Input

2 1


Output

7


Input

3 2


Output

21

Note

In the first example a year consists on only one month, so the wardrobe does not eat dresses at all.

In the second example after the first month there are 3 dresses with 50% probability and 4 dresses with 50% probability. Thus, in the end of the year there are 6 dresses with 50% probability and 8 dresses with 50% probability. This way the answer for this test is (6 + 8) / 2 = 7.
	import java.util.*;
	import java.awt.List;
	import java.io.*;
	import java.lang.*;
		
	public class code4
		{
	 	public static void main(String[] args)
			{
				InputReader in = new InputReader(System.in);
				PrintWriter pw = new PrintWriter(System.out);
				
				//Code starts..
			
			
				
				long x = in.nextLong();
				long k = in.nextLong();
				
				
				long two = binaryExponentiation(2, k);
				two %= mod;
				long mul = ((x)*two);
				
				long s1 = ((mul*(mul+1))/2);
				//s1 %= mod;
				long m2 = (mul - two);
				
				//pw.println(m2);
				long s2 = ((m2 * (m2+1))/2);
				//s2 %= mod;
				long s3 = s1 - s2;
				//s3 %= mod;
				//pw.println(s1+" "+s2);
				//pw.println(1<<(k-1));
			
				
				long k3 = 2*x - 1;
				
				if(k!=0 && x>0)
					pw.println((k3%mod * two%mod + 1)%mod);
				else
					pw.println((x*2)%mod);
	 			
				
				//Code ends....
				
				pw.flush();
				pw.close();
			}
		
			
			static class InputReader 
			{
				 
				private final InputStream stream;
				private final 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 String nextLine() 
				{
					int c = snext();
					while (isSpaceChar(c))
						c = snext();
					StringBuilder res = new StringBuilder();
					do 
					{
						res.appendCodePoint(c);
						c = snext();
					} while (!isEndOfLine(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;
				}
		 
				private boolean isEndOfLine(int c) 
				{
					return c == '\n' || c == '\r' || c == -1;
				}
		 
				public interface SpaceCharFilter
			    {
					public boolean isSpaceChar(int ch);
				}
			}
			public static long c = 0;
			
			public static long mod = 1000000007;
			public static int d;
			public static int p;
			public static int q;
			public static boolean flag;
			public static long INF= Long.MAX_VALUE;
			
			
			public static double slope(pair p1, pair p2)
			{
				double m = INF;
				if((p1.x - p2.x)!=0)
				m =  p1.y - p2.y/(p1.x - p2.x); 
				
				
				return Math.abs(m);
				
			}
			
			public static long gcd(long i, long l) {
				if (i == 0)
					return (long) l;
				return gcd(l % i, i);
			}
	
			
			
			/*public static int findGCD(int arr[], int n)
			{
			    int result = arr[0];
			    for (int i=1; i<n; i++)
			        result = gcd(arr[i], result);
			 
			    return result;
			}
			*/
			
		
	 
		
			
			
			
			
		    public static long lcm(int[] numbers) {
		        long lcm = 1;
		        int divisor = 2;
		        while (true) {
		            int cnt = 0;
		            boolean divisible = false;
		            for (int i = 0; i < numbers.length; i++) {
		                if (numbers[i] == 0) {
		                    return 0;
		                } else if (numbers[i] < 0) {
		                    numbers[i] = numbers[i] * (-1);
		                }
		                if (numbers[i] == 1) {
		                    cnt++;
		                }
		                if (numbers[i] % divisor == 0) {
		                    divisible = true;
		                    numbers[i] = numbers[i] / divisor;
		                }
		            }
		            if (divisible) {
		                lcm = lcm * divisor;
		            } else {
		                divisor++;
		            }
		            if (cnt == numbers.length) {
		                return lcm;
		            }
		        }
		    }
			public static long fact(long n) {
				
				long factorial = 1;
				 for(int i = 1; i <= n; i++)
			        {
			            factorial *= i;
			        }
				 return factorial;
			}
			
			public static void factSieve(int[] a, int n) {
				
				
				for(int i=2; i<=n; i+=2)
					a[i] = 2;
				
				
				for(int i=3; i<=n; i+=2)
				{
					if(a[i]==0)
					{
						a[i] = i;
						
						for(int j=i; j*i<=n; j++)
						{
							a[i*j] = i;	
						}
					}
				}
				
				int k = 1000;
				while(k!=1)
				{
					System.out.print(a[k]+" ");
					k /= a[k];
					
				}
			}
		
			
			
			public static long choose(long total, long choose){
			    if(total < choose)
			        return 0;
			    if(choose == 0 || choose == total)
			        return 1;
			    return (choose(total-1,choose-1)+choose(total-1,choose))%mod;
			}
			
			public static long[] suffle(long[] a,Random gen)
			{
				int n = a.length;
				for(int i=0;i<n;i++)
				{
					int ind = gen.nextInt(n-i)+i;
					long temp = a[ind];
					a[ind] = a[i];
					a[i] = temp;
				}
				return a;
			}
			
			public static long[] sort(long[] a)
			{
				Random gen = new Random();
				int n = a.length;
				for(int i=0;i<n;i++)
				{
					int ind = gen.nextInt(n-i)+i;
					long temp = a[ind];
					a[ind] = a[i];
					a[i] = temp;
				}
				
				Arrays.sort(a);
				return a;
			}
			
			public static int[] sort(int[] a)
			{
				Random gen = new Random();
				int n = a.length;
				for(int i=0;i<n;i++)
				{
					int ind = gen.nextInt(n-i)+i;
					int temp = a[ind];
					a[ind] = a[i];
					a[i] = temp;
				}
				
				Arrays.sort(a);
				return a;
			}
			
			public static int floorSearch(int arr[], int low, int high, int x)
			{
			    if (low > high)
			        return -1;
			 
			    if (x > arr[high])
			        return high;
			    int mid = (low+high)/2;
			 
			 
			    if (mid > 0 && arr[mid-1] < x && x < arr[mid])
			        return mid-1;
			 
			    if (x < arr[mid])
			        return floorSearch(arr, low, mid-1, x);
			 
			    return floorSearch(arr, mid+1, high, x);
			}
			
			
			public static void swap(int a, int b){
				int temp = a;
				a = b;
				b = temp;
			}
			public static ArrayList<Integer> primeFactorization(int n)
			{
				ArrayList<Integer> a =new ArrayList<Integer>();
				for(int i=2;i*i<=n;i++)
				{
					while(n%i==0)
					{
						a.add(i);
						n/=i;
					}
				}
				if(n!=1)
					a.add(n);
				return a;
			}
			
			
			public static void sieve(boolean[] isPrime,int n)
			{
				for(int i=1;i<n;i++)
					isPrime[i] = true;
				
				isPrime[0] = false;
				isPrime[1] = false;
				
				for(int i=2;i*i<n;i++)
				{
					if(isPrime[i] == true)
					{
						for(int j=(2*i);j<n;j+=i)
							isPrime[j] = false;
					}
				}
			}
			
			public static int lowerbound(ArrayList<Long> net, long c2) {
				int i=Collections.binarySearch(net, c2);
				if(i<0)
					i = -(i+2);
				return i;
				
				
			}
			
			public static int lowerboundArray(long[] psum, long c2) {
				int i=Arrays.binarySearch(psum, c2);
				if(i<0)
					i = -(i+2);
				return i;
				
				
			}
			
			public static int uperboundArray(long[] psum, long c2) {
				int i=Arrays.binarySearch(psum, c2);
				if(i<0)
					i = -(i+1);
				return i;
				
				
			}
			
			
			public static int uperbound(ArrayList<Long> net, long c2) {
				int i=Collections.binarySearch(net, c2);
				if(i<0)
					i = -(i+1);
				return i;
				
				
			}
			
			
			public static int GCD(int a,int b)
			{
				if(b==0)
					return a;
				else
					return GCD(b,a%b);
			}
			
			public static long GCD(long a,long b)
			{
				if(b==0)
					return a;
				else
					return GCD(b,a%b);
			}
			
			public static void extendedEuclid(int A,int B)
			{
				if(B==0)
				{
					d = A;
					p = 1 ;
					q = 0;
				}
				else
				{
					extendedEuclid(B, A%B);
					int temp = p;
					p = q;
					q = temp - (A/B)*q;
				}
			}
			
			public static long LCM(long a,long b)
			{
				return (a*b)/GCD(a,b);
			}
			
			public static int LCM(int a,int b)
			{
				return (a*b)/GCD(a,b);
			}
			
			public static int binaryExponentiation(int x,int n)
			{
			    int result=1;
			    while(n>0)
			    {
			        if(n % 2 ==1)
			            result=result * x;
			        x=x*x;
			        n=n/2;
			    }
			    return result;
			}
			
			
			public static int[] countDer(int n)
		    {
		        int der[] = new int[n + 1];
		     
		        der[0] = 1;
		        der[1] = 0;
		        der[2] = 1;
		     
		        for (int i = 3; i <= n; ++i)
		            der[i] = (i - 1) * (der[i - 1] + der[i - 2]);
		     
		        // Return result for n
		        return der;
		    }
			
			
			 static long binomialCoeff(int n, int k)
			    {
			    long C[][] = new long[n+1][k+1];
			    int i, j;
			     
			        // Calculate  value of Binomial Coefficient in bottom up manner
			    for (i = 0; i <= n; i++)
			    {
			        for (j = 0; j <= Math.min(i, k); j++)
			        {
			            // Base Cases
			            if (j == 0 || j == i)
			                C[i][j] = 1;
			      
			            // Calculate value using previosly stored values
			            else
			                C[i][j] = C[i-1][j-1] + C[i-1][j];
			          }
			     }
			      
			    return C[n][k];
			    }
			
			public static long binaryExponentiation(long x,long n)
			{
			    long result=1;
			    while(n>0)
			    {
			        if(n % 2 ==1)
			            result= (result * x)%mod;
			        x=(x%mod * x%mod)%mod;
			        n=n/2;
			    }
			    return result%mod;
			}
			
			public static int modularExponentiation(int x,int n,int M)
			{
			    int result=1;
			    while(n>0)
			    {
			        if(n % 2 ==1)
			            result=(result * x)%M;
			        x=(x%M*x%M)%M;
			        n=n/2;
			    }
			    return result;
			}
			
			public static long modularExponentiation(long x,long n,long M)
			{
			    long result=1;
			    while(n>0)
			    {
			        if(n % 2 ==1)
			            result=(result %M* x%M)%M;
			        x=(x*x)%M;
			        n=n/2;
			    }
			    return result;
			}
			
			public static int modInverse(int A,int M)
			{
			    return modularExponentiation(A,M-2,M);
			}
			
			public static long modInverse(long A,long M)
			{
			    return modularExponentiation(A,M-2,M);
			}
			
			
			public static boolean checkYear(int year)
		    {
				if (year % 400 == 0)
		            return true;
		     
		        if (year % 100 == 0)
		            return false;
		     
		        if (year % 4 == 0)
		            return true;
		        return false;
		    }
			
			public static boolean isPrime(int n)
			{
			    
			    if (n <= 1)  return false;
			    if (n <= 3)  return true;
			    
			    if (n%2 == 0 || n%3 == 0) 
			    	return false;
			 
			    for (int i=5; i*i<=n; i=i+6)
			    {
			        if (n%i == 0 || n%(i+2) == 0)
			           return false;
			    }
			    
			    return true;
			}
			
			static class pair implements Comparable<pair>
	 
			{
				Long x;
				Integer y;
				pair(long a,int y)
				{
					this.x=a;
					this.y=y;
				}
				
				public int compareTo(pair o) {
					int result = x.compareTo(o.x);
					if(result==0)
						result = y.compareTo(o.y);
					
					return result;
				}  
				
				public String toString()
				{
					return x+" "+y;
				}
				
				public boolean equals(Object o)
				{
					if (o instanceof pair)
				    {
						pair p = (pair)o;
						return p.x == x && p.y == y ;
					}
					return false;
				}
				
				public int hashCode()
				{
					return new Long(x).hashCode()*31 + new Long(y).hashCode();
				}
			}
		
			
			static class triplet implements Comparable<triplet>
			{
				Integer x,y,z;
				triplet(int x,int y,int z)
				{
					this.x = x;
					this.y = y;
					this.z = z;
				}
				
				public  int compareTo(triplet o)
				{
					int result = x.compareTo(o.x);
					if(result==0)
						result =  y.compareTo(o.y);
					if(result==0)
						result = z.compareTo(o.z);
	 
					return result;
				}
				
				public boolean equlas(Object o)
				{
					if(o instanceof triplet)
					{
						triplet p = (triplet)o;
						return x==p.x && y==p.y && z==p.z;
					}
					return false;
				}
				
				public String toString()
				{
					return x+" "+y+" "+z;
				}
				public int hashCode()
				{
					return new Long(x).hashCode()*31 + new Long(y).hashCode() + new Long(z).hashCode(); 
				}
			}
			
	 
			
			
	
		}
		
			