/* 
 * Problem: HAOI2005 route
 * Author: Guo Jiabao
 * Time: 2009.4.14 14:05
 * State: Solved
 * Memo: Dijkstra 次短路径
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
const int MAXN=51,MAXM=MAXN*MAXN*2,INF=0x7FFFFFF;
using namespace std;
struct edge
{
	edge *next,*op;
	int t,c;
}ES[MAXM],*V[MAXN],*SPE[MAXN];
int N,S,T,P,SPC,S0,S1,S2,EC=-1;
int sp[MAXN];
bool mf[MAXN],vis[MAXN];
inline void addedge(int a,int b,int c)
{
	ES[++EC].next=V[a];
	V[a]=ES+EC; V[a]->t=b; V[a]->c=c;
	ES[++EC].next=V[b];
	V[b]=ES+EC; V[b]->t=a; V[b]->c=c;
	V[a]->op=V[b]; V[b]->op=V[a];
}

int adjm[MAXN][MAXN];
void init()
{
	int i,j,c;
	freopen("route.in","r",stdin);
	freopen("route.out","w",stdout);
	scanf("%d%d%d",&N,&S,&T);
	for (i=1;i<=N;i++)
	{
		for (j=1;j<=N;j++)
		{
			scanf("%d",&c);
			adjm[i][j]=c;
			if (i>=j && adjm[i][j]!=adjm[j][i])
				c=1575;
			if (i<j && c)
				addedge(i,j,c);
		}
	}
	scanf("%d",&P);
	for (i=1;i<=P;i++)
	{
		scanf("%d",&c);
		mf[c]=true;
	}
}
void dijkstra()
{
	int i,j,Mini;
	for (i=1;i<=N;i++)
		sp[i]=INF,vis[i]=false;
	sp[S]=0;
	for (i=S;i;)
	{
		vis[i]=true;
		for (edge *e=V[i];e;e=e->next)
		{
			if (!mf[j=e->t] && sp[i] + e->c < sp[j])
				sp[j]=sp[i] + e->c;
		}
		Mini=INF;i=0;
		for (j=1;j<=N;j++)
			if (!vis[j] && sp[j] < Mini)
			{
				Mini=sp[j];
				i=j;
			}
	}
}
void dfs(int i)
{
	vis[i]=true;
	for (edge *e=V[i];e;e=e->next)
	{
		int j=e->t;
		if (sp[j] + e->c == sp[i])
		{
			SPE[++SPC]=e->op;
			if (!vis[j])
				dfs(j);
		}
	}
}
void solve()
{
	int i,c;
	S2=INF;
	dijkstra();
	S0=sp[T];
	memset(mf,0,sizeof(mf));
	dijkstra();
	S1=sp[T];
	memset(vis,0,sizeof(vis));
	dfs(T);
	for (i=1;i<=SPC;i++)
	{
		edge *e=SPE[i];
		c=e->c;
		e->c=INF;
		dijkstra();
		e->c=c;
		c=sp[T];
		if (c<S2)
			S2=c;
	}
}
int main()
{
	init();
	solve();
	printf("%d %d %dn",S0,S1,S2);
	return 0;
}