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 Rust (1.15.1) (judge verdict: Wrong Answer)

// This code is generated by [cargo-atcoder](https://github.com/tanakh/cargo-atcoder)
// Original source code:
/*
use proconio::input;
use proconio::marker::Chars;
use std::cmp::{max, min};

fn main() {
    input! {
        a: Chars,
        b: Chars,
        c: Chars,
    }

    let v1 = unite(&a, &b);
    let v2 = unite(&b, &a);

    // dbg!(&v1, &v2);

    let w1 = unite(&c, &v1);
    let w2 = unite(&c, &v2);
    let w3 = unite(&v1, &c);
    let w4 = unite(&v2, &c);

    let v3 = unite(&a, &c);
    let w5 = unite(&v3, &b);
    let v4 = unite(&b, &c);
    let w6 = unite(&v4, &a);

    let v = vec![w1.len(), w2.len(), w3.len(), w4.len(), w5.len(), w6.len()];
    let ans: usize = *v.iter().min().unwrap();
    println!("{}", ans);
}

fn unite(a: &[char], b: &[char]) -> Vec<char> {
    let mut v = vec![];
    v.append(&mut a.to_vec());
    v.append(&mut b.to_vec());
    for i in 0..a.len() {
        if let Some(mut s) = str_matches(&a[i..], &b) {
            let mut w = vec![];
            // aの残りを足す
            w.append(&mut a.to_vec()[0..i].to_vec());
            w.append(&mut s);
            v = w;
            break;
        }
    }

    v
}

fn str_matches(s: &[char], t: &[char]) -> Option<Vec<char>> {
    let l = min(s.len(), t.len());
    let mut ret = vec![];
    for i in 0..l {
        match char_matches(s[i], t[i]) {
            Some(c) => { ret.push(c) },
            None => return None,
        }
    }

    // 残りを足す
    if s.len() > l {
        ret.append(&mut s.to_vec()[l..].to_vec())
    } else if t.len() > l {
        ret.append(&mut t.to_vec()[l..].to_vec())
    }

    Some(ret)
}

fn char_matches(c1: char, c2: char) -> Option<char> {
    if c1 == '?' {
        Some(c2)
    } else if c2 == '?' {
        Some(c2)
    } else if c1 == c2 {
        Some(c1)
    } else {
        None
    }
}
*/

fn main() {
    let exe = "/tmp/bin915D44D9";
    std::io::Write::write_all(&mut std::fs::File::create(exe).unwrap(), &decode(BIN)).unwrap();
    std::fs::set_permissions(exe, std::os::unix::fs::PermissionsExt::from_mode(0o755)).unwrap();
    std::process::exit(std::process::Command::new(exe).status().unwrap().code().unwrap())
}

fn decode(v: &str) -> Vec<u8> {
    let mut ret = vec![];
    let mut buf = 0;
    let mut tbl = vec![64; 256];
    for i in 0..64 { tbl[TBL[i] as usize] = i as u8; }
    for (i, c) in v.bytes().filter_map(|c| { let c = tbl[c as usize]; if c < 64 { Some(c) } else { None } }).enumerate() {
        match i % 4 {
            0 => buf = c << 2,
            1 => { ret.push(buf | c >> 4); buf = c << 4; }
            2 => { ret.push(buf | c >> 2); buf = c << 6; }
            3 => ret.push(buf | c),
            _ => unreachable!(),
        }
    }
    ret
}

const TBL: &'static [u8] = b"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
const BIN: &'static str = "<base64-encoded ELF executable removed>";