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

import static java.lang.Math.*;

public class Main {

    long mod = (long) (1e9 + 7);

    void solve() throws Throwable {
        long x = readLong(), k = readLong();
        if (x == 0) {
            System.out.println(0);
            return;
        }
        long r = solveFast(x, k);
        //long r2 = solveSlow(x, k) % mod;
        System.out.println(r);
        //System.out.println(r2);
    }

    private long solveSlow(long x, long k) {
        List<Long> a = new ArrayList<>();
        a.add(x);
        for (int i = 0; i < k; i++) {
            dodouble(a);
            a = eat(a);
        }
        dodouble(a);
        long sum = 0;
        for (Long v : a) {
            sum = (sum + v) % mod;
        }
        return sum * rev(a.size(), mod) % mod;
    }

    private List<Long> eat(List<Long> a) {
        List<Long> r = new ArrayList<>();
        for (Long v : a) {
            r.add(v);
            r.add((v - 1 + mod) % mod);
        }
        return r;
    }

    private void dodouble(List<Long> a) {
        for (int i = 0; i < a.size(); i++) {
            a.set(i, a.get(i) * 2 % mod);
        }
    }

    private long solveFast(long x, long k) {
        long n = binpow(2, k, mod);
        long ma = (binpow(2, k + 1, mod) * (x % mod)) % mod;
        long mi = (ma - n * 2 + 2 + mod * 100) % mod;
        return ((ma + mi) * rev(2, mod)) % mod;
    }

    private long rev(long a, long mod) {
        return binpow(a, mod - 2, mod);
    }

    //-------------------------------------------------

    final boolean ONLINE_JUDGE = !new File("input.txt").exists();

    BufferedReader in;
    PrintWriter out;
    StringTokenizer tok;

    public void run() {
        Runnable run = () -> {
            try {
                long startTime = System.currentTimeMillis();
                Locale.setDefault(Locale.US);
                if (ONLINE_JUDGE) {
                    in = new BufferedReader(new InputStreamReader(System.in));
                    out = new... Which one is the correct time complexity of the code snippet: constant, linear, quadratic, cubic, log(n), nlog(n) or NP-hard?