#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;
typedef long long ll;

template <typename T> vector<int> z_function(int n, const T &s) {
  vector<int> z(n, n);
  int l = 0, r = 0;
  for (int i = 1; i < n; i++) {
    z[i] = (i > r ? 0 : min(r - i + 1, z[i - l]));
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) {
      z[i]++;
    }
    if (i + z[i] - 1 > r) {
      l = i;
      r = i + z[i] - 1;
    }
  }
  return z;
}

template <typename T> vector<int> z_function(const T &s) {
  return z_function((int)s.size(), s);
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  string s, t;
  cin >> s >> t;
  int n = (int)s.size();
  int m = (int)t.size();
  ll ans = 0;
  for (int tt = 0; tt < 2; ++tt) {
    vector<vector<int>> cnt_occ(n, vector<int>(n));
    for (int i = 0; i < n; ++i) {
      string cur = s.substr(i);
      cur += '#';
      int cur_size = (int)cur.size();
      cur += t;
      vector<int> z = z_function(cur);
      for (int j = 0; j < m; ++j) {
        if (z[cur_size + j] > 0) {
          ++cnt_occ[i][i + z[cur_size + j] - 1];
        }
      }
      for (int j = n - 2; j >= 0; --j) {
        cnt_occ[i][j] += cnt_occ[i][j + 1];
      }
    }
    vector<vector<int>> mem_cnt(n, vector<int>(2 * n));
    for (int i = 0; i < n; ++i) {
      string cur = s.substr(i);
      cur += '#';
      int cur_size = (int)cur.size();
      cur += s;
      vector<int> z = z_function(cur);
      for (int j = 0; j < n; ++j) {
        ++mem_cnt[i][j + z[cur_size + j]];
      }
      for (int j = 2 * n - 2; j >= 0; --j) {
        mem_cnt[i][j] += mem_cnt[i][j + 1];
      }
    }
    for (int i = 0; i < n; ++i) {
      for (int j = i; j < n; ++j) {
        if (tt == 0) {
          ans += cnt_occ[i][j];
        }
        if (j + 1 < n) {
          int extra = mem_cnt[j + 1][i] - (n - i);
          ans += (ll)extra * cnt_occ[i][j];
        }
      }
    }
    swap(s, t);
    swap(n, m);
  }
  cout << ans << '\n';
}