#include <iostream>
#include <cstdio>
#include <cstring>
#define MAXN 550
#define MOD 3210121

using namespace std;

char a[MAXN]="heck", b[MAXN]="yeah";
int n, m, din[2][MAXN][MAXN], rez;

void add(int &to, int who)
{
    to += who;
    to %= MOD;
}

void solve()
{
    int ci = 1;
    din[0][0][0] = 1;
    for (int i = 0; i <= n; i++) {
        ci ^= 1;
        for (int j = 0; i+j <= n; j++) {
            for (int st = 0; st <= m; st++) {
                int dr = i+st-j;
                if (dr < 0 || st+dr > m || din[ci][j][st] == 0) continue;
                if (i+j + st + dr >= n+m-1) {
                    add(rez, din[ci][j][st]);
                    din[ci][j][st] = 0;
                    continue;
                }
                if (a[i+1] == a[n-j]) add(din[!ci][j+1][st], din[ci][j][st]);
                if (a[i+1] == b[m-dr]) add(din[!ci][j][st], din[ci][j][st]);
                if (b[st+1] == a[n-j]) add(din[ci][j+1][st+1], din[ci][j][st]);
                if (b[st+1] == b[m-dr]) add(din[ci][j][st+1], din[ci][j][st]);
                din[ci][j][st] = 0;
            }
        }
    }
}

int main()
{
    freopen("iv.in", "r", stdin);
    freopen("iv.out", "w", stdout);

    gets(a+1);
    gets(b+1);
    n = strlen(a+1);
    m = strlen(b+1);
    a[0] = '.', a[n+1] = ',', b[0] = '/', b[m+1] = ';';
    solve();
    printf("%d", rez);
    return 0;
}