#include <fstream>
#include <vector>
#include <queue>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
const int N = 100010;
vector<int> v[N];
queue <int> q;
int n,m,s,x,y,d[N];
int main()
{
    f >> n >> m >> s;
    for ( ; m; m--)
    {
        f >> x >> y;
        v[x].push_back(y);
    }
    q.push(s);
    d[s]=1;
    while(q.size())
    {
        x=q.front();
        q.pop();
        for(auto vec : v[x])
        if(!d[vec])
        {
            d[vec]=d[x]+1;
            q.push(vec);
        }
    }
    for( int i = 1 ; i <= n ; i++)
        g<<d[i]-1<<' ';

    return 0;
}