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

vector <int> l[100001];
queue <int> q;
int viz[100001];

int main()
{
    int n, m, xs, i, x, y;
    fin>>n>>m>>xs;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        l[x].push_back(y);
    }
    viz[xs]=1;
    q.push(xs);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(i=0;i<l[nod].size();i++)
        {
            if(viz[l[nod][i]]==0)
            {
                viz[l[nod][i]]=viz[nod]+1;
                q.push(l[nod][i]);
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        fout<<viz[i]-1<<" ";
    }
}