Problem:
Score : 500 points

Problem Statement

Snuke has a string s.
From this string, Anuke, Bnuke, and Cnuke obtained strings a, b, and c, respectively, as follows:

Choose a non-empty (contiguous) substring of s (possibly s itself). Then, replace some characters (possibly all or none) in it with ?s.

For example, if s is mississippi, we can choose the substring ssissip and replace its 1-st and 3-rd characters with ? to obtain ?s?ssip.

You are given the strings a, b, and c.
Find the minimum possible length of s.

Constraints

1 \leq |a|, |b|, |c| \leq 2000

a, b, and c consists of lowercase English letters and ?s.

Input

Input is given from Standard Input in the following format:

a
b
c

Output

Print the minimum possible length of s.

Sample Input 1

a?c
der
cod

Sample Output 1

7

For example, s could be atcoder.

Sample Input 2

atcoder
atcoder
???????

Sample Output 2

7

a, b, and c may not be distinct.

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>

using namespace std;

bool isalp(char c) {
    return 'a' <= c && c <= 'z';
}

string make(string current, string add) {
    for (int i = 0; i < current.size(); i++) {
        bool ok = true;
        for (int j = 0; i + j < current.size() && j < add.size(); j++) {
            if (isalp(current[i + j]) && isalp(add[j]) && current[i + j] != add[j]) {
                ok = false;
            }
        }

        if (ok) {
            for (int j = 0; j < add.size(); j++) {
                if (i + j < current.size()) {
                    if (!isalp(current[i + j]) && isalp(add[j])) {
                        current[i + j] = add[j];
                    }
                } else {
                    current.push_back(add[j]);
                }
            }
            return current;
        }
    }

    return current + add;
}

int solve(string &a, string &b, string &c) {
    return make(make(a, b), c).size();
}

int main() {
    string a, b, c;
    cin >> a >> b >> c;

    int ret = 1145141919;
    ret = min(ret, solve(a, b, c));
    ret = min(ret, solve(a, c, b));
    ret = min(ret, solve(b, a, c));
    ret = min(ret, solve(b, c, a));
    ret = min(ret, solve(c, a, b));
    ret = min(ret, solve(c, b, a));

    cout << ret << endl;
    return 0;
}