#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

vector<int>graf [100005];
int viz[100005];
queue <int> q;

int main()
{
    int n, m, s, t, x, y;
    cin>>n>>m>>s;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        graf[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        viz[i]=-1;
    viz[s]=0;
    q.push(s);
    while(!q.empty())
    {
        t=q.front();
        for(int i=0;i<graf[t].size();i++)
            if(viz[graf[t][i]] == -1)
            {
                viz[graf[t][i]] = viz[t]+1;
                q.push(graf[t][i]);
            }
        q.pop();
    }
    for(int i=1;i<=n;i++)
        cout<<viz[i]<<" ";
    return 0;
}