#include <bits/stdc++.h>
using namespace std;
int main(){
  string S;
  cin >> S;
  string T;
  cin >> T;
  long long ans = 0;
  for (int i = 0; i < 2; i++){
    int N = S.size();
    int M = T.size();
    vector<vector<int>> lcp1(N + 1, vector<int>(N + 1, 0));
    for (int j = N - 1; j >= 0; j--){
      for (int k = N - 1; k >= 0; k--){
        if (S[j] == S[k]){
          lcp1[j][k] = lcp1[j + 1][k + 1] + 1;
        }
      }
    }
    vector<vector<int>> imos(N + 1, vector<int>(N + 1, 0));
    for (int j = 0; j < N; j++){
      for (int k = j + 1; k <= N; k++){
        int d = min(k - j, lcp1[j][k]);
        imos[j + d][k]++;
        if (i == 0){
          imos[j][k]--;
        } else {
          if (j > 0){
            imos[j - 1][k]--;
          }
        }
      }
    }
    for (int j = N - 1; j >= 0; j--){
      for (int k = 0; k <= N; k++){
        imos[j][k] += imos[j + 1][k];
      }
    }
    vector<vector<int>> lcp2(N + 1, vector<int>(M + 1, 0));
    for (int j = N - 1; j >= 0; j--){
      for (int k = M - 1; k >= 0; k--){
        if (S[j] == T[k]){
          lcp2[j][k] = lcp2[j + 1][k + 1] + 1;
        }
      }
    }
    vector<vector<int>> sum(N + 1, vector<int>(N + 2, 0));
    for (int j = 0; j <= N; j++){
      for (int k = 0; k <= N; k++){
        sum[j][k + 1] = sum[j][k] + imos[j][k];
      }
    }
    for (int j = 0; j < N; j++){
      for (int k = 0; k < M; k++){
        ans += sum[j][min(N, j + lcp2[j][k]) + 1] - sum[j][j + 1];
      }
    }
    swap(S, T);
  }
  cout << ans << endl;
}