use std::collections::HashSet;

use proconio::{input, marker::Usize1};
fn main() {
    input! {
        n: usize, m: usize, k: usize,
        a: [Usize1; k],
        t: [[usize; n]; n]
    }
    let mut ans = n * n * 2;
    for x in 0..n {
        dfs(x, n, &t, &a, m, 0, &mut HashSet::new(), &mut ans);
    }
    if ans == n * n * 2 {
        println!("-1");
    } else {
        println!("{}", ans);
    }
}
fn dfs(x: usize, n: usize, t: &[Vec<usize>], a: &[usize], m: usize, c: usize, visited: &mut HashSet<usize>, ans: &mut usize) {
    if !visited.insert(x) {
        return;
    }
    if visited.len() == m {
        *ans = usize::min(*ans, c + a.iter().copied().map(|a| t[x][a]).min().unwrap());
        return;
    }
    
    for i in 0..n {
        if i != n {
            dfs(i, n, t, a, m, c + t[x][i], &mut visited.clone(), ans)
        }
    }
}