#include<fstream>
#include<vector>
#include<string.h>

#define NMAX 502
#define MOD 666013
#define alf 30

using namespace std;



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

int A[NMAX][NMAX]; int N;int M ;int B[NMAX][NMAX];int lmax;int indA[NMAX][alf]; int indB[NMAX][alf];

char s[NMAX]; char h[NMAX];

int C[NMAX][NMAX];

void add(int &a, const int b){
    a += b;
    if(a >= MOD) a -= MOD;
}

void Read() {

    fin >> (s + 1);

    N = strlen(s + 1);
    fin >> (h + 1);
    M = strlen(h + 1);
    s[++N] = '#';
    h[++M] = '#';
}

void Solve() {

    for(int i = 1 ;i <= N ;i++){
        for(int j = 0 ;j < alf; ++j)
            indA[i][j] = indA[i - 1][j];
        indA[i][s[i] - 'a'] = i;
    }

     for(int i = 1 ;i <= M ; i++){
        for(int j = 0 ;j < alf; ++j)
            indB[i][j] = indB[i - 1][j];
        indB[i][h[i] - 'a'] = i;
    }

    for(int i = 1; i <= N; ++i)
        for(int j = 1 ; j <= M ; ++j)
            if(s[i] == h[j])
                A[i][j] = A[i - 1][j - 1] + 1;
            else
                A[i][j] = max(A[i - 1][j], A[i - 1][j]);


    for(int i = 1; i <= N; ++i)
        for(int j = 1; j <= M; ++j){
            if(A[i][j] == 1){
                C[i][j] = 1;
                continue;
            }
            for(int k = 0 ; k < alf; ++k){
            int ii = indA[i - 1][k];
            int jj = indB[j - 1][k];
                if(A[i][j] == A[ii][jj] + 1)
                    add(C[i][j], C[ii][jj]);
            }
    }
    fout << C[N][M];
}


int main() {

 Read ();

 Solve ();

 return 0;
}