using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <algorithm>

#define pb push_back
#define sz size
#define f first
#define s second
#define II inline
#define ll long long
#define db double
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define all(v) v.begin() , v.end()
#define CC(v) memset((v),0,sizeof((v)))
#define CP(v,w) memcpy((v),(w),sizeof((w)))
#define mp make_pair

#define IN "iv.in"
#define OUT "iv.out"
#define N_MAX 1<<9
#define mod 3210121

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;

int N,M;
char V1[N_MAX],V2[N_MAX];
int A[N_MAX][N_MAX][N_MAX];//,B[N_MAX][N_MAX];

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	fgets(V1+1,1<<10,stdin);
	fgets(V2+1,1<<10,stdin);
	
	N = strlen(V1+1) - 1;
	M = strlen(V2+1) - 1;
}

II void solve()
{
	int rez(0);
	A[0][N+1][0] = 1;
//	int h1 = N>>1,h2 = h1+1,h3 = M>>1,h4 = h3+1;
	
	FOR(i1,0,N)
	for(int i2=N+1;i2>i1;--i2)
	FOR(i3,0,M)
	{
		int i4 = (N+M - i3 + 2) - (i1+i2); 
		
		if(V1[i1+1] == V2[i3+1])
			A[i1+1][i2][i3+1] += A[i1][i2][i3];
		if(V1[i1+1] == V2[i4-1])
			A[i1+1][i2][i3] += A[i1][i2][i3];
		if(V1[i2-1] == V2[i3+1])
			A[i1][i2-1][i3+1] += A[i1][i2][i3];		
		if(V1[i2-1] == V2[i4-1])
			A[i1][i2-1][i3] += A[i1][i2][i3];
		
	//	printf("%d %d %d %d : %d\n",i1,i2,i3,i4,A[i1][i2][i3]);
		if(i1+1 == i2 && i3+1 == i4)
		{
			rez += A[i1][i2][i3];	
			if(rez > mod)
				rez -= mod;
		}	
	}
	
	printf("%d\n",rez);
}

int main()
{
	scan();
	solve();
	return 0;
}