#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("O3")


using namespace std;


#define ll long long
#define ld long double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()


const int MOD = 1e9 + 7;


using ULL = unsigned long long;

static const ULL P = (1ull << 61) - 1;
mt19937_64 rnd(random_device{}());
uniform_int_distribution<ULL> dist(257, P - 1);
const ULL B = dist(rnd);


static inline ULL add(ULL a, ULL b){
    a += b;
    if (a >= P) {
        a -= P;
    }
    return a;
}


static inline ULL mul(ULL a, ULL b){
    __uint128_t c = __uint128_t(a) * b;
    return add(c >> 61, c & P);
}


const int N = 2000;


ULL pula[N * N];
int cnt = 0;


int under(ULL x) {
    int l = 1, r = cnt, sol = 0;
    while (l <= r) {
        int m = (l + r) / 2;
        if (pula[m] <= x) {
            sol = m;
            l = m + 1;
        } else {
            r = m - 1;
        }
    }
    return sol;
}


int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    string s, t;
    cin >> s >> t;
    int n = s.size();
    int m = t.size();
    s = "#" + s;
    t = "#" + t;
    for (int i = 1; i <= m; i += 1) {
        ULL hsh = 1;
        for (int j = i; j <= m; j += 1) {
            hsh = mul(hsh, B);
            hsh = add(hsh, t[j]);
            pula[++cnt] = hsh;
        }
    }
    sort(pula + 1, pula + cnt + 1);
    vector<vector<int>> occ(n + 1, vector<int>(n + 1));
    for (int i = 1; i <= n; i += 1) {
        ULL hsh = 1;
        for (int j = i; j <= n; j += 1) {
            hsh = mul(hsh, B);
            hsh = add(hsh, s[j]);
            occ[i][j] = under(hsh) - under(hsh - 1);
        }
    }
    vector<vector<ll>> f(n + 1, vector<ll>(n + 1));
    for (int i = 1; i <= n; i += 1) {
        f[i][i] = occ[i][i];
        if (i + 1 <= n) {
            f[i][i + 1] = occ[i][i] + occ[i + 1][i + 1] + occ[i][i + 1];
        }
    }
    for (int h = 3; h <= n; h += 1) {
        for (int i = 1; i + h - 1 <= n; i += 1) {
            int j = i + h - 1;
            f[i][j] = f[i + 1][j] + f[i][j - 1] - f[i + 1][j - 1] + occ[i][j];
        }
    }
    __int128 ans = 0;
    for (int i = 1; i <= n; i += 1) {
        for (int j = 1; j <= n; j += 1) {
            ans += 1LL * f[i][j] * (j - i + 1) * (j - i + 1);
        }
        ans %= MOD;
    }
    cout << int(ans) << "\n";
    return 0;
}