#include <fstream>
#include <vector>
#include <deque>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,nod,a,b,s,d[50010];
vector <int> v[50010];
deque <int> Q;
int main()
{
    f>>n>>m>>s;
    for(;m;m--)
    {
        f>>a>>b;
        v[a].push_back(b);
    }

    Q.push_back(s);d[s]=1;
    while(Q.size())
    {
        nod=Q.front();
        Q.pop_front();

        for(auto it:v[nod])
            if(!d[it])
            {
                d[it]=d[nod]+1;
                Q.push_back(it);
            }
    }
    for(int i=1;i<=n;i++)
            g<<d[i]-1<<' ';
    return 0;
}