#include <cstdio>
#include <vector>
#include <map>
using namespace std;

#define N 1000
#define M 10000
int n,m,s,t,qh,qt,q[2*N],tbl[2*N],where[2*N];
vector<pair<int,int> > es[N],es_rev[N];

int main() {
  while(scanf("%d",&n),n) {
    scanf("%d%d%d",&s,&t,&m); --s,--t;
    for (int i=0;i<n;++i) {
      es[i].clear();
      es_rev[i].clear();
    }
    for (int i=0;i<m;++i) {
      int a,b; scanf("%d%d",&a,&b); --a,--b;
      es[a].push_back(make_pair(b,i));
      es_rev[b].push_back(make_pair(a,i));
    }

    int ans=INT_MAX,ans_where=0;
    memset(tbl,-1,sizeof(tbl));
    memset(where,-1,sizeof(where));

    qh=qt=0;
    q[qt++]=2*s;
    tbl[2*s]=0;
    where[2*s]=-1;
    while(qh!=qt) {
      int cur=q[qh++];
      int pos=cur/2,rev=cur%2;
      if (pos==t) {
	if (tbl[cur]<ans||tbl[cur]==ans&&where[cur]<ans_where) {
	  ans=tbl[cur];
	  ans_where=where[cur];
	}
      }
      
      int ncost=tbl[cur]+1;
      for (int i=0;i<es[pos].size();++i) {
	int npos=es[pos][i].first;
	int next=2*npos+rev;
	if (tbl[next]==-1||tbl[next]==ncost&&where[cur]<where[next]) {
	  if (tbl[next]==-1) q[qt++]=next;
	  tbl[next]=ncost;
	  where[next]=where[cur];
	}
      }
      if (!rev) {
	for (int i=0;i<es_rev[pos].size();++i) {
	  int npos=es_rev[pos][i].first;
	  int next=2*npos+1;
	  if (tbl[next]==-1||tbl[next]==ncost&&es_rev[pos][i].second<where[next]) {
	    if (tbl[next]==-1) q[qt++]=next;
	    tbl[next]=ncost;
	    where[next]=es_rev[pos][i].second;
	  }
	}
      }
    }
    if (tbl[2*t]==-1) {
      fprintf(stderr,"no route\n");
    }

    printf("%d %d\n",ans,ans_where+1);
  }
}