1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

const ll MOD = 1956887306301647087;
ll add(ll a, ll b) {
  return a+b >= MOD ? a+b - MOD : a+b; }
ll sub(ll a, ll b) { return add(a, MOD - b); }
ll mul(ll a, ll b) {
  return (__int128)a * b % MOD;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  vector<vector<ll>> h(3);
  int n;
  rep(i, 0, 3) {
    string s;
    cin >> s;
    n = sz(s);
    h[i].resize(n + 1);
    reverse(all(s));
    ll pot = 1;
    rep(j, 0, n) {
      h[i][j + 1] = add(h[i][j], mul(pot, s[j] - '0'));
      pot = mul(pot, 10);
    }
  }
  ll odp = 0;
  map<ll, int> ile;
  rep(i, 0, n + 1) {
    ll x = sub(add(h[0][i],h[1][i]),h[2][i]);
    odp += ile[x];
    ile[x]++;
  }
  cout << odp << '\n';
}