Problem:
Score : 500 points

Problem Statement

You are given two integer sequences S and T of length N and M, respectively, both consisting of integers between 1 and 10^5 (inclusive).

In how many pairs of a subsequence of S and a subsequence of T do the two subsequences are the same in content?

Here the subsequence of A is a sequence obtained by removing zero or more elements from A and concatenating the remaining elements without changing the order.

For both S and T, we distinguish two subsequences if the sets of the indices of the removed elements are different, even if the subsequences are the same in content.

Since the answer can be tremendous, print the number modulo 10^9+7.

Constraints

1 \leq N, M \leq 2 \times 10^3

The length of S is N.

The length of T is M.

1 \leq S_i, T_i \leq 10^5

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N M
S_1 S_2 ... S_{N-1} S_{N}
T_1 T_2 ... T_{M-1} T_{M}

Output

Print the number of pairs of a subsequence of S and a subsequence of T such that the subsequences are the same in content, modulo 10^9+7.

Sample Input 1

2 2
1 3
3 1

Sample Output 1

3

S has four subsequences: (), (1), (3), (1, 3).

T has four subsequences: (), (3), (1), (3, 1).

There are 1 \times 1 pair of subsequences in which the subsequences are both (), 1 \times 1 pair of subsequences in which the subsequences are both (1), and 1 \times 1 pair of subsequences in which the subsequences are both (3), for a total of three pairs.

Sample Input 2

2 2
1 1
1 1

Sample Output 2

6

S has four subsequences: (), (1), (1), (1, 1).

T has four subsequences: (), (1), (1), (1, 1).

There are 1 \times 1 pair of subsequences in which the subsequences are both (), 2 \times 2 pairs of subsequences in which the subsequences are both (1), and 1 \times 1 pair of subsequences in which the subsequences are both (1,1), for a total of six pairs.
Note again that we distinguish two subsequences if the sets of the indices of the removed elements are different, even if the subsequences are the same in content.

Sample Input 3

4 4
3 4 5 6
3 4 5 6

Sample Output 3

16

Sample Input 4

10 9
9 6 5 7 5 9 8 5 6 7
8 6 8 5 5 7 9 9 7

Sample Output 4

191

Sample Input 5

20 20
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

Sample Output 5

846527861

Be sure to print the number modulo 10^9+7.

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <stdlib.h>

int main(void) {
    int i, j;

    int N, M;
    scanf("%d %d", &N, &M);

    int  *S, *T;
    S = calloc(N, sizeof(int));
    T = calloc(M, sizeof(int));

    for (i = 0; i < N; i++) {
        scanf("%d", &S[i]);
    }
    for (i = 0; i < M; i++) {
        scanf("%d", &T[i]);
    }

    long long **dp;
    long long **sum;
    dp = calloc(N, sizeof(long long *));
    sum = calloc(N, sizeof(long long *));
    for (i = 0; i < N; i++) {
        dp[i] = calloc(M, sizeof(long long));
        sum[i] = calloc(M, sizeof(long long));
    }


    dp[0][0] = (sum[0][0] = (S[0] == T[0]) ? 1 : 0);

    for (i = 1; i < M; i++) {
        dp[0][i] = (S[0] == T[i]) ? 1 : 0;
        sum[0][i] = sum[0][i-1] + dp[0][i];
    }

    for (i = 1; i < N; i++) {
        dp[i][0] = (S[i] == T[0]) ? 1 : 0;
        sum[i][0] = sum[i-1][0] + dp[i][0];
    }

    for (i = 1; i < N; i++) {
        for (j = 1; j < M; j++) {
            dp[i][j] = (S[i] == T[j]) ? (sum[i-1][j-1] + 1) % 1000000007: 0;
            sum[i][j] = (sum[i][j-1] + sum[i-1][j] - sum[i-1][j-1] + dp[i][j]) % 1000000007;
        }
    }

    printf("%lld\n", sum[N-1][M-1]);

    return 0;

}