#include <bits/stdc++.h>
#define ll long long

using namespace std;

ifstream fin("subsir.in");
ofstream fout("subsir.out");

const int NMAX = 500;
const int MOD = 666013;

int n, m;
string a, b;
int dp[NMAX + 1][NMAX + 1];
int dp_ways[NMAX + 1][NMAX + 1];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    fin >> a >> b;
    n = a.size();
    m = b.size();
    a = "%" + a;
    b = "%" + b;

    dp_ways[0][0] = 1;
    for(int i = 1; i <= n; i++) {
        dp_ways[i][0] = 1;
    }
    for(int j = 1; j <= m; j++) {
        dp_ways[0][j] = 1;
    }

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= m; j++) {
            if(a[i] == b[j]) {
                dp[i][j] = dp[i - 1][j - 1] + 1;
                dp_ways[i][j] = dp_ways[i - 1][j - 1];
            }
            else if(dp[i - 1][j] > dp[i][j - 1]) {
                dp[i][j] = dp[i - 1][j];
                dp_ways[i][j] = dp_ways[i - 1][j];
            }
            else if(dp[i][j - 1] > dp[i - 1][j]) {
                dp[i][j] = dp[i][j - 1];
                dp_ways[i][j] = dp_ways[i][j - 1];
            }
            else {
                dp[i][j] = dp[i][j - 1];
                dp_ways[i][j] = (dp_ways[i - 1][j] + dp_ways[i][j - 1] - (dp[i - 1][j - 1] == dp[i][j] ? dp_ways[i - 1][j - 1] : 0) + MOD) % MOD;
            }
        }
    }
    fout << dp_ways[n][m] << '\n';
    return 0;
}