The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Greg and Graph

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputGreg 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*x*_{i}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*x*_{i}, then Greg wants to know the value of the following sum: .

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 *a*_{ij} (1 ≤ *a*_{ij} ≤ 10^{5}, *a*_{ii} = 0) represents the weight of the edge that goes from vertex *i* to vertex *j*.

The next line contains *n* distinct integers: *x*_{1}, *x*_{2}, ..., *x*_{n} (1 ≤ *x*_{i} ≤ *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

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/17/2022 15:14:17 (k3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|