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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#else
#define debug(...) 228
#endif


typedef long long ll;
typedef long double ld;

#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)

vector<int> read_vec(int n) {
    vector<int> v(n);
    for (int& t : v) cin >> t;
    return v;
}

template<typename T>
inline void upd_max(T& a, T b) {
    if (a < b) {
        a = b;
    }
}

template<typename T>
inline void upd_min(T& a, T b) {
    if (a > b) {
        a = b;
    }
}

const ll mod = 124124124141421;


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    int n;
    vector<ll> d;
    vector<ll> pw10;
    FOR(i, 0, 3) {
        string s;
        cin >> s;
        n = s.size();
        if (i == 0) {
            d = vector<ll>(n + 1);
            pw10 = vector<ll>(n);
            pw10[0] = 1;
            FOR(it, 1, n) {
                pw10[it] = (10 * pw10[it - 1]) % mod;
            }
        }
        ll t = 0;
        for (int j = n - 1; j >= 0; j--) {
            t += (s[j] - '0') * pw10[n - j - 1];
            t %= mod;
            if (i == 2) d[j] -= t;
            else d[j] += t;
        }
    }
    map<ll,int> s;
    ll ans = 0;
    for (int i = n; i >= 0; i--) {
        d[i] %= mod;
        if (d[i] < 0) d[i] += mod;
        ans += s[d[i]]++;
    }
    cout << ans << '\n';
    return 0;
}