#include <vector>
#include <fstream>
#include <queue>

using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");

vector <int> v[100001];
queue <int> q;
int c[100001];
bool viz[100001];
int sol,x,y,n,m,i,s;

int main()
{
    cin>>n>>m>>s;
    for(i=1; i<=n; ++i)
        c[i]=-1;

    c[s]=0;

    for(i=1; i<=m; ++i)
    {
        cin>>x>>y;
        v[x].push_back(y);
    }
    q.push(s);
    viz[s]=1;

    while(!q.empty())
    {
        x=q.front();
        q.pop();

        for(i=0; i<v[x].size(); ++i)
        {
            if(viz[v[x][i]]==0)
            {
                viz[v[x][i]]=1;
                q.push(v[x][i]);
                c[v[x][i]]=c[x]+1;
            }
        }
    }

    for(i=1; i<=n; ++i)
        cout<<c[i]<<" ";
    return 0;
}