#include <fstream>
#include <vector>
#include <queue>
#include <stdio.h>

using namespace std;

#define N 100000
#define M 1000000

ifstream in("bfs.in");
ofstream out("bfs.out");

queue<int> q;
vector<int> graph[N];

int distance[N];
int n,m,s,x,y;

void BFS(int source) {
	int node;

	q.push(source);
	distance[source]=0;

	while(!q.empty()) {
		node=q.front();
	
		for (unsigned int i=0;i<graph[node].size();j++) {
			if (distance[[graph[node]][i]]==-1) {
				distance[graph[node][i]]=distance[node]+1;
				q.push(graph[node][i]);
			}
		}

		q.pop();
	}
 }

int main() {
	in>>n>>m>>s;

	memset(distance,-1,sizeof(distance));
	for (unsigned int i=0;i<M;i++) {
		in>>x>>y;
		graph[x].push_back(y);
	}

	BFS(s);

	for (unsigned int i=0;i<n;i++)
		out<<distance[i];

	return 0;
}