#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");

#define nmax 100010

int n,m,x,y,s,d[nmax];
vector<int> a[nmax];
queue<int> q;

void bfs(int start)
{
    int i,lg,nod;
    d[start]=0;
    q.push(start);
    while (!q.empty())
    {
        nod=q.front();
        q.pop();
        lg=a[nod].size();
        for (i=0;i<lg;i++)
            if (d[a[nod][i]]==-1)
            {
                d[a[nod][i]]=d[nod]+1;
                q.push(a[nod][i]);
            }
    }
}

int main()
{
    int i,j;
    cin>>n>>m>>s;
    for (i=1;i<=m;i++)
    {
        cin>>x>>y;
        a[x].push_back(y);
    }
    for (i=1;i<=n;i++)
        d[i]=-1;
    bfs(s);
    for (i=1;i<=n;i++)
        cout<<d[i]<<" ";
}