#include <iostream>
#include <fstream>
#include <deque>
#include <queue>
#include <vector>
#include <cmath>

using namespace std;

struct st
{
	int c, p, r;
	int revd;
	bool operator < (const st & s) const	
	{
		if(c!=s.c) return c>s.c;
		if(revd!=s.revd) return revd > s.revd;
		if(p!=s.p) return p<s.p;
		return r<s.r;
	}
};

main()
{
	ifstream cin("E.txt");
	int n, s, t, m;
	while(cin>>n && n)
	{
		vector<pair<int,int> > go[n], rev[n];
		cin >> s >> t >> m; s--; t--;
		for(int i=0; i<m; i++)
		{
			int a, b;
			cin >> a >> b;
			a--; b--;

			go[a].push_back(make_pair(b,i+1));
			rev[b].push_back(make_pair(a,i+1));
		}

		priority_queue<st> q;
		q.push((st){0,s,0,0});
		bool seen[2][1000+1]={{0}};
		while(q.size())
		{
			//cerr<<"q.size="<<q.size()<<endl;
			st c = q.top(); q.pop();
			if(seen[c.r][c.p]) continue;
			seen[c.r][c.p]=1;
			if(c.p==t)
			{
				cout << c.c << ' ' << c.revd << endl;
				break;
			}

			for(int i=0; i<go[c.p].size(); i++)
			{
				q.push((st){c.c+1, go[c.p][i].first, c.r, c.revd});
			}
			if(c.r==0) for(int i=0; i<rev[c.p].size(); i++)
			{
				q.push((st){c.c+1, rev[c.p][i].first, 1, rev[c.p][i].second});
			}
		}

	}
	return 0;
}