#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s,a,b,i,v2[100001],v3[100001];
queue<pair<int,int> >q;
vector<int>v[100001];
int main()
{
    f>>n>>m>>s;
    for(i=1; i<=m; i++)
    {
        f>>a>>b;
        v[a].push_back(b);
    }
    q.push({s,0});
    while(!q.empty())
    {
        a=q.front().first;
        b=q.front().second;
        q.pop();
        v2[a]=1;
        v3[a]=b;
        for(i=0; i<v[a].size(); i++)
        {
            if(!v2[v[a][i]])
            {
                v2[v[a][i]]=1;
                q.push({v[a][i],b+1});
            }
        }
    }
    for(i=1; i<=n; i++)
    {
        if(v3[i]>0 or i==s)
        {
            g<<v3[i]<<" ";
        }
        else
        {
            g<<"-1 ";
        }
    }
    return 0;
}