Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he has invented a new game:

  * The game consists of n steps. 
  * On the i-th step Greg removes vertex number xi from the graph. As Greg removes a vertex, he also removes all the edges that go in and out of this vertex. 
  * Before executing each step, Greg wants to know the sum of lengths of the shortest paths between all pairs of the remaining vertices. The shortest path can go through any remaining vertex. In other words, if we assume that d(i, v, u) is the shortest path between vertices v and u in the graph that formed before deleting vertex xi, then Greg wants to know the value of the following sum: <image>. 



Help Greg, print the value of the required sum before each step.

Input

The first line contains integer n (1 ≤ n ≤ 500) — the number of vertices in the graph.

Next n lines contain n integers each — the graph adjacency matrix: the j-th number in the i-th line aij (1 ≤ aij ≤ 105, aii = 0) represents the weight of the edge that goes from vertex i to vertex j.

The next line contains n distinct integers: x1, x2, ..., xn (1 ≤ xi ≤ n) — the vertices that Greg deletes.

Output

Print n integers — the i-th number equals the required sum before the i-th step.

Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams of the %I64d specifier.

Examples

Input

1
0
1


Output

0 

Input

2
0 5
4 0
1 2


Output

9 0 

Input

4
0 3 1 1
6 0 400 1
2 4 0 1
1 1 1 0
4 1 2 3


Output

17 23 404 0 
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
# from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
import copy
import time
starttime = time.time()
mod = int(pow(10, 9) + 7)
mod2 = 998244353
from sys import stdin
input = stdin.readline
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def L(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]
try:
    # sys.setrecursionlimit(int(pow(10,6)))
    sys.stdin = open("input.txt", "r")
    # sys.stdout = open("../output.txt", "w")
except:
    pass

from array import array
def input():
    return sys.stdin.buffer.readline().decode('utf-8')
def solve():
    n = int(input())
    matrix = [array('i', list(map(int, input().split()))) for _ in range(n)]
    a = tuple(map(lambda x: int(x) - 1, input().split()))
    ans = [''] * n
 
    for i in range(n - 1, -1, -1):
        x = a[i]
        for u in range(n):
            for v in range(n):
                if matrix[u][v] > matrix[u][x] + matrix[x][v]:
                    matrix[u][v] = matrix[u][x] + matrix[x][v]
 
        upper, lower = 0, 0
        for u in a[i:]:
            for v in a[i:]:
                lower += matrix[u][v]
            if lower >= 10**9:
                upper += 1
                lower -= 10**9
        ans[i] = str(upper * 10**9 + lower)
 
    sys.stdout.buffer.write(' '.join(ans).encode('utf-8'))
solve()




endtime = time.time()
# print(f"Runtime of the program is {endtime - starttime}")
