#ifdef MAIN bool __multi__ = 0; namespace XK { void solve() { string X, Y, Z; cin >> X >> Y >> Z; set st; // cerr << X << ' ' << Y << ' ' << Z << '\n'; rep(i, sz(X) + 1) rep(j, sz(Y) + 1) rep(k, sz(Z) + 1) { if((i * j * k) == 0) continue; // cerr << X.substr(0, i) << ' ' << Y.substr(0, j) << ' ' << Z.substr(0, k) << '\n'; st.insert(X.substr(0, i) + Y.substr(0, j) + Z.substr(0, k)); st.insert(X.substr(0, i) + Z.substr(0, k) + Y.substr(0, j)); st.insert(Y.substr(0, j) + X.substr(0, i) + Z.substr(0, k)); st.insert(Y.substr(0, j) + Z.substr(0, k) + X.substr(0, i)); st.insert(Z.substr(0, k) + X.substr(0, i) + Y.substr(0, j)); st.insert(Z.substr(0, k) + Y.substr(0, j) + X.substr(0, i)); } // for(auto s : st) cout << s << '\n'; cout << sz(st); } }; #else #include "cassert" #include "cmath" #include "cstdint" #include "cstdio" #include "cstdlib" #include "cstring" #include "algorithm" #include "bitset" #include "chrono" #include "complex" #include "deque" #include "functional" #include "iostream" #include "limits" #include "map" #include "numeric" #include "queue" #include "random" #include "set" #include "sstream" #include "string" #include "unordered_map" #include "unordered_set" #include "utility" #include "vector" #include "array" using namespace std; #define int long long using ll = long long; using ull = unsigned long long; const ll INF = 1ll << 60; const ll LINF = 0x1fffffffffffffff; const ll MINF = 0x7fffffffffff; template bool chmax(A& l, const B& r){ return r > l ? l = r, 1 : 0; } template bool chmin(A& l, const B& r){ return r < l ? l = r, 1 : 0; } #define sz(x) ssize(x) #define rep(i, a) for(ll i = 0; i < (a); i ++) #define Rep(i, a, b) for(ll i = (a); i < (b); i ++) #define rrep(i, a, b) for(ll i = (b); i --> (a); ) #define all(x) begin(x), end(x) #define fst first #define snd second #define pb push_back template using V = vector; template using AR = array; #define MAIN #include __FILE__ signed main() {ios::sync_with_stdio(0);cin.tie(0);fixed(cout).precision(12);int t = 1;if(__multi__) cin >> t;while(t --) XK::solve();} #endif