#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
vector <int> v1[100005];
        int  v2[100005];
queue <int> v;
int main()
{
int n, m, k;
in >> n >> m >> k;
    v.push(k);
    v2[k] = 1;
for(int i = 1; i <= m; ++i)
{
int a, b;
in >> a >> b;
v1[a].push_back(b);
}
while(!v.empty())
{
int x = v.front();
for(int i = 0; i < v1[x].size(); i ++)
        {
if(v2[v1[x][i]] == 0)
{
v2[v1[x][i]] = v2[x] + 1;
v.push(v1[x][i]);
}
        }
v.pop();
}
for(int i = 1; i <= n; i ++)
out << v2[i] - 1 << " ";
return 0;
}