#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <random>
#include <assert.h>
using namespace std;
const string file = "bfs";
const string infile = file + ".in";
const string outfile = file + ".out";
const int INF = 0x3f3f3f3f;
//#define ONLINE_JUDGE
int main()
{
#ifdef ONLINE_JUDGE
ostream &fout = cout;
istream &fin = cin;
#else
fstream fin(infile.c_str(), ios::in);
fstream fout(outfile.c_str(), ios::out);
#endif
int N, M, S;
fin >> N >> M >> S;
vector<vector<int> > G(N + 1);
for(int i = 0; i < M; i++)
{
int x, y;
fin >> x >> y;
G[x].push_back(y);
}
vector<int> dist(N + 1, -1);
vector<bool> viz(N + 1, false);
queue<int> que;
que.push(S);
dist[S] = 0;
viz[S] = true;
while(que.empty() == false)
{
int x = que.front();
que.pop();
for(vector<int>::iterator itr = G[x].begin();
itr != G[x].end();
itr++)
{
if(viz[*itr] == false)
{
dist[*itr] = dist[x] + 1;
que.push(*itr);
}
}
}
for(int i = 1; i <= N; i++)
{
fout << dist[i] << " ";
}
fout << "\n";
#ifdef ONLINE_JUDGE
#else
fout.close();
fin.close();
#endif
}