#include<bits/stdc++.h>
using namespace std;
const int N=55,INF=0x3f3f3f3f;
int n,st,ed;
int w[N][N],dis[N][N],dis1[N][N],dis2[N][N];
int p,t;
bool vis[N];
int main()
{
	freopen("route.in","r",stdin);
	freopen("route.out","w",stdout);
	memset(dis,0x3f,sizeof(dis));
	memset(dis1,0x3f,sizeof(dis1));
	memset(dis2,0x3f,sizeof(dis2));
	int k;
	scanf("%d%d%d",&n,&st,&ed);
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
			scanf("%d",&k),w[i][j]=(k==0?INF:k);
	for(int i=1;i<=n;++i)
		for(int j=1;j<=n;++j)
			dis[i][j]=dis1[i][j]=dis2[i][j]=w[i][j];
	scanf("%d",&p);
	for(int i=1;i<=p;++i) scanf("%d",&t),vis[t]=1;
	for(int k=1;k<=n;++k)
		for(int i=1;i<=n;++i)
			for(int j=1;j<=n;++j)
				if(dis[i][j]>=dis[i][k]+dis[k][j])
				{
					dis1[i][j]=dis[i][j];
					dis[i][j]=dis[i][k]+dis[k][j];
				}
	for(int k=1;k<=n;++k)
	{
		if(vis[k]) continue;
		for(int i=1;i<=n;++i)
		{
			if(vis[i]) continue;
			for(int j=1;j<=n;++j)
			{
				if(vis[j]) continue;
				if(dis2[i][j]>dis2[i][k]+dis2[k][j])
					dis2[i][j]=dis2[i][k]+dis2[k][j];
			}
		}
	}
	printf("%d %d %d\n",dis2[st][ed],dis[st][ed],dis1[st][ed]);
	return 0;
}