#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#include <algorithm>
#include <utility>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <iomanip>
#include <set>
#include <map>
#include <cassert>
#include <ctime>
#include <list>
#include <iomanip>

using namespace std;

string file = "subsir";

ifstream cin( (file + ".in").c_str() );
ofstream cout( (file + ".out").c_str() );

const int MAXN = 505;
const int MOD = 666013;
const int oo = (1<<31)-1;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

struct ClassComp {
    inline bool operator () (const int &a, const int &b) const {
        return a > b;
    }
};

int N, M;
char A[MAXN], B[MAXN];
int dp[MAXN][MAXN], nr[MAXN][MAXN];

inline void BuildDynamic() {
    for(int i = 0 ; i <= N ; ++ i)
        nr[i][0] = 1;
    for(int j = 0 ; j <= N ; ++ j)
        nr[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;
                nr[i][j] = nr[i-1][j-1];
            }
            else {
                if(dp[i-1][j] > dp[i][j-1]) {
                    dp[i][j] = dp[i-1][j];
                    nr[i][j] = nr[i-1][j];
                }
                else if(dp[i][j-1] > dp[i-1][j]) {
                    dp[i][j] = dp[i][j-1];
                    nr[i][j] = nr[i][j-1];
                }
                else {
                    dp[i][j] = dp[i][j-1];
                    nr[i][j] = (nr[i-1][j] + nr[i][j-1]) % MOD;
                    if(dp[i-1][j-1] == dp[i-1][j])
                        nr[i][j] = (nr[i][j] - nr[i-1][j-1]) % MOD;
                }
            }
    cout << nr[N][M] << '\n';
}

int main() {
    cin >> (A + 1) >> (B + 1);
    N = strlen(A + 1);
    M = strlen(B + 1);
    BuildDynamic();
    cin.close();
    cout.close();
    return 0;
}