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: Accepted)

// This code is generated by [cargo-atcoder](https://github.com/tanakh/cargo-atcoder)
// Original source code:
/*
use proconio::input;
#[allow(unused_imports)]
use proconio::marker::*;
#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
#[allow(unused_imports)]
use std::f64::consts::*;

#[allow(unused)]
const INF: usize = std::usize::MAX / 4;
#[allow(unused)]
const M: usize = 1000000007;

fn main() {
    input! {
        a: Chars,
        b: Chars,
        c: Chars,
    }
    let na = a.len();
    let nb = b.len();
    let nc = c.len();

    let offset = na + nb + nc;
    let size = 2 * offset;
    let mut ab = vec![true; size];
    let mut ac = vec![true; size];
    let mut bc = vec![true; size];

    for i in 0..na {
        for j in 0..nb {
            if a[i] != '?' && b[j] != '?' && a[i] != b[j] {
                ab[offset + i - j] = false;
            }
        }
    }

    for i in 0..na {
        for k in 0..nc {
            if a[i] != '?' && c[k] != '?' && a[i] != c[k] {
                ac[offset + i - k] = false;
            }
        }
    }

    for j in 0..nb {
        for k in 0..nc {
            if b[j] != '?' && c[k] != '?' && b[j] != c[k] {
                bc[offset + j - k] = false;
            }
        }
    }

    let mut result = INF;
    for j in 0..size {
        for k in 0..size {
            if offset + k < size + j && j <= offset + k && ab[j] && ac[k] && bc[offset + k - j] {
                let left = min(offset, min(j, k));
                let right = max(offset + na, max(j + nb, k + nc));
                result = min(result, right - left);
            }
        }
    }
    println!("{}", result);
}
*/

fn main() {
    let exe = "/tmp/binCF49D7F8";
    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>";