#include <stdio.h>
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

const int kMaxN = 505;
const int kSigma = 26;
const int kMod = 666013;

char a[kMaxN];
char b[kMaxN];

int dp[kMaxN][kMaxN];
int cnt[kMaxN][kMaxN];

int last_a[kMaxN][kSigma];
int last_b[kMaxN][kSigma];

int main() {
  cin.sync_with_stdio(false);

  ifstream cin("subsir.in");
  ofstream cout("subsir.out");

  cin >> (a + 1);
  cin >> (b + 1);

  int n = strlen(a + 1);
  int m = strlen(b + 1);

  a[++n] = 'a';
  b[++m] = 'a';

  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < kSigma; j++) {
      last_a[i][j] = last_a[i - 1][j];
    }
    last_a[i][a[i] - 'a'] = i;
  }

  for (int i = 1; i <= m; i++) {
    for (int j = 0; j < kSigma; j++) {
      last_b[i][j] = last_b[i - 1][j];
    }
    last_b[i][b[i] - 'a'] = i;
  }

  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;
      } else {
        dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
      }
    }
  }

  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (a[i] == b[j]) {
        if (dp[i][j] == 1) {
          cnt[i][j] = 1;
          continue;
        }
        for (int k = 0; k < kSigma; k++) {
          int pos_a = last_a[i - 1][k];
          int pos_b = last_b[j - 1][k];
          if (pos_a && pos_b && dp[pos_a][pos_b] + 1 == dp[i][j]) {
            cnt[i][j] += cnt[pos_a][pos_b];
            if (cnt[i][j] >= kMod) {
              cnt[i][j] -= kMod;
            }
          }
        }
      }
    }
  }

  cout << cnt[n][m] << '\n';

  return 0;
}