import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;

class Main {
	
	public static void main(String[] args) {
		new Main().run();
	}
	
	
	void run() {
		solve();
	}
	
	long mod=(long)1e9+7;
	
	long pow(long a, long n) {
		if (n==0) return 1;
		return pow(a*a%mod,n/2) * (n%2==1?a:1) %mod;
	}
	
	long inv(long a) {
		return pow(a, mod-2);
	}
	
	long c(int n, int k) {
//		if (n==k) return 1;
		if (n<0||k<0||n-k<0) return 0;
//		return (c(n-1,k)+c(n-1,k-1))%mod;
		return fac[n]*ifac[k]%mod*ifac[n-k]%mod;
	}
	
	long slow(int H, int W) {
		long ans=0;
		for (int i=0;i<=H;++i) {
			for (int j=0;j<=W;++j) {
				ans+=pow(2,i*j)*pow(-1,i+j)%mod*c(H,i)%mod*c(W,j)%mod;
				ans%=mod;
			}
		}
		ans=ans*pow(-1,H+W)%mod;
		ans=(ans+mod)%mod;
		return ans;
	}
	
	int MAX=2000000;
	
	long[] fac=new long[MAX];
	long[] ifac=new long[MAX];
	long[] inv=new long[MAX];
	{
		fac[0]=fac[1]=ifac[0]=ifac[1]=inv[0]=inv[1]=1;
		for (int i=2;i<MAX;++i) {
			fac[i]=i*fac[i-1]%mod;
			inv[i]=mod-(mod/i)*inv[(int)(mod%i)]%mod;
			ifac[i]=inv[i]*ifac[i-1]%mod;
		}
	}

	void solve() {
		FastScanner sc=new FastScanner();
		PrintWriter pw=new PrintWriter(System.out);
		
		
		int H=sc.nextInt();
		int W=sc.nextInt();
		long ans=0;
		for (int i=0;i<=W;++i) {
			ans+=pow(1-pow(2,i),H)*(i%2==0?1:-1)%mod*c(W,i)%mod;
			ans%=mod;
		}
		ans=ans*pow(-1,H+W)%mod;
		ans=(ans+mod)%mod;
		System.out.println(ans);
		pw.close();
	}
	
	static void tr(Object...objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}


class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
    	return (int)nextLong();
    }
}