import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Jenish
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CIvanTheFoolAndTheProbabilityTheory solver = new CIvanTheFoolAndTheProbabilityTheory();
        solver.solve(1, in, out);
        out.close();
    }

    static class CIvanTheFoolAndTheProbabilityTheory {
        long mod = (long) (1e9 + 7);
        int n;
        int m;

        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            n = in.scanInt();
            m = in.scanInt();
            if (n == 1 && m == 1) {
                out.println(2);
                return;
            }


            if (n > m) {
                int temp = n;
                n = m;
                m = temp;
            }

            long dp[][] = new long[3][2];
            dp[1][0] = 1;
            dp[1][1] = 1;
            dp[2][0] = 2;
            dp[2][1] = 2;

            long f[] = new long[(int) (m + 5)];
            f[1] = 2;
            f[2] = 4;
            for (int i = 3; i <= m; i++) {

                int cu = i % 3;
                int pre = (i - 1) % 3;
                int sec_pre = (i - 2) % 3;
                dp[cu][0] = dp[cu][1] = 0;
                {
                    dp[cu][0] = sum(dp[cu][0], dp[pre][1]);
                    dp[cu][0] = sum(dp[cu][0], dp[sec_pre][1]);

                }
                {
                    dp[cu][1] = sum(dp[cu][1], dp[pre][0]);
                    dp[cu][1] = sum(dp[cu][1], dp[sec_pre][0]);
                }
                f[i] = sum(dp[cu][0], dp[cu][1]);

            }


            if (n == 1 || m == 1) {
                out.println(f[Math.max(n, m)]);
                return;
            }


            long ans = sum(f[n], f[m] - 2);
            out.println(ans);


        }

        long sum(long a, long b) {
            while (a < 0) a += mod;
            while (b < 0) b += mod;
            return (a + b) % mod;
        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int INDEX;
        private BufferedInputStream in;
        private int TOTAL;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (INDEX >= TOTAL) {
                INDEX = 0;
                try {
                    TOTAL = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (TOTAL <= 0) return -1;
            }
            return buf[INDEX++];
        }

        public int scanInt() {
            int I = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    I *= 10;
                    I += n - '0';
                    n = scan();
                }
            }
            return neg * I;
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

    }
}

