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


using namespace std;

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

int lungime[100005],n,m,x,y,s;
bool vizitat[100005];
deque<int>q;
vector<int>v[100005];



void bfs()
{
    int node;
    while(!q.empty())
    {
        node=q.front();
        q.pop_front();

        for(int i=0;i<v[node].size();i++)
        {
            if(!vizitat[v[node][i]])
            {
                q.push_back(v[node][i]);
                vizitat[v[node][i]]=1;
                lungime[v[node][i]]=lungime[node]+1;

            }


        }

    }

}

int main()
{
    in>>n>>m>>s;
    for(int i=1;i<=n;i++)
        lungime[i]=-1;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
    vizitat[s]=1;
    lungime[s]=0;
    q.push_back(s);
    bfs();
    for(int i=1;i<=n;i++)
        out<<lungime[i]<<" ";
    return 0;
}