#include <bits/stdc++.h>

using namespace std;

const int Z = 100005; 
const int N = 100005; 
bool ab[N+Z], ac[N+Z], bc[N+Z];

bool match(char c0, char c1){
    return (c0=='?'||c1=='?'||c0==c1);
}

void solve() {
    string a,b,c;
    cin >> a >> b >> c;
    int A = a.size();
    int B = b.size();
    int C = c.size();
    int res = A+B+C;

    for (int i = 0; i < A; i++) {
        for (int j = 0; j < B; j++) {
            if (!match(a[i], b[j]))
                ab[i-j + Z] = 1;
        }
    }
    for (int i = 0; i < A; i++) {
        for (int j = 0; j < C; j++) {
            if (!match(a[i], c[j]))
                ac[i-j + Z] = 1;
        }
    }
    for (int i = 0; i < B; i++) {
        for (int j = 0; j < C; j++) {
            if (!match(b[i], c[j]))
                bc[i-j + Z] = 1;
        }
    }
    const int M = 2020 * 2; 
    for (int i = -M; i < M; i++) {
        for (int j = -M; j < M; j++) {
            if (!ab[i+Z] && !ac[j+Z] && !bc[j-i+Z]) {
                int L = min({0,i,j});
                int R = max({A,i+B,j+C});
                res = min(res, R-L);
            }
        }
    }
    cout << res;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
    return 0;
}

### Prompt

Generate a CPP solution to the following problem:

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.

Examples

Input

a?c
der
cod


Output

7


Input

atcoder
atcoder
???????


Output

7

### Response

```cpp
#include <bits/stdc++.h>

using namespace std;

const int Z = 100005; 
const int N = 100005; 
bool ab[N+Z], ac[N+Z], bc[N+Z];

bool match(char c0, char c1){
    return (c0=='?'||c1=='?'||c0==c1);
}

void solve() {
    string a,b,c;
    cin >> a >> b >> c;
    int A = a.size();
    int B = b.size();
    int C = c.size();
    int res = A+B+C;

    for (int i = 0; i < A; i++) {
        for (int j = 0; j < B; j++) {
            if (!match(a[i], b[j]))
                ab[i-j + Z] = 1;
        }
    }
    for (int i = 0; i < A; i++) {
        for (int j = 0; j < C; j++) {
            if (!match(a[i], c[j]))
                ac[i-j + Z] = 1;
        }
    }
    for (int i = 0; i < B; i++) {
        for (int j = 0; j < C; j++) {
            if (!match(b[i], c[j]))
                bc[i-j + Z] = 1;
        }
    }
    const int M = 2020 * 2; 
    for (int i = -M; i < M; i++) {
        for (int j = -M; j < M; j++) {
            if (!ab[i+Z] && !ac[j+Z] && !bc[j-i+Z]) {
                int L = min({0,i,j});
                int R = max({A,i+B,j+C});
                res = min(res, R-L);
            }
        }
    }
    cout << res;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
    return 0;
}

```