#include <fstream>
#include <vector>
#include <deque>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

vector <int> a[100100];
deque <int> q;

int n,m,viz[100100];

void bfs(int s)
{
    int i,val,nod;
    q.push_back(s);
    viz[s]=1;


    while(q.size()!=0)
    {
        nod=q.front();
        val=viz[nod]+1;

        for(i=0;i<a[nod].size();i++)
            if(viz[a[nod][i]]==0)
        {
            q.push_back(a[nod][i]);
            viz[a[nod][i]]=val;
        }
    q.pop_front();
    }

}




int s,i,x,y;

int main()
{
    f>>n>>m>>s;

    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x].push_back(y);

    }


    bfs(s);

    for(i=1;i<=n;i++)
        g<<viz[i]-1<<" ";
    return 0;
}