#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 = "iv";

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

const int MAXN = 515;
const int oo = (1<<31)-1;
const int MOD = 3210121;

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;
    }
};

char a[MAXN], b[MAXN];
int N, M, Ans, dp[2][MAXN][MAXN];

inline void insert(int &where, const int what) {
    where += what;
    if(where >= MOD)
        where -= MOD;
}

int main() {
    cin >> (a + 1) >> (b + 1);
    N = strlen(a + 1);
    M = strlen(b + 1);
    dp[0][0][0] = 1;
    for(int i = 0 ; i <= N ; ++ i)
        for(int j = 0 ; i + j <= N ; ++ j)
            for(int k = 0 ; k <= M ; ++ k) {
                int l = k + i - j;
                if( l < 0 || k + l > M)
                    continue;
                if( i + j + k + l == N + M || i + j + k + l == N + M - 1) {
                    insert(Ans, dp[i&1][j][k]);
                    continue;
                }
                if (a[i + 1] == a[N - j])                   insert(dp[(i + 1) & 1][j + 1][k], dp[i & 1][j][k]);
                if (M - l >= 1 && a[i + 1] == b[M - l])     insert(dp[(i + 1) & 1][j][k], dp[i & 1][j][k]);
                if (b[k + 1] == a[N - j])                   insert(dp[i & 1][j + 1][k + 1], dp[i & 1][j][k]);
                if (M - l >= 1 && b[k + 1] == b[M - l])     insert(dp[i & 1][j][k + 1], dp[i & 1][j][k]);
                dp[i & 1][j][k] = 0;
            }
    cout << Ans << '\n';
    cin.close();
    cout.close();
    return 0;
}