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

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> v[100005];
queue <int>c;
int viz[100005];
void bfs(int x)
{
    int nod, i;
    c.push(x);
    viz[x]=1;
    while(!c.empty())
    {
        nod=c.front();
        c.pop();
        for(i=0;i<v[nod].size();i++)
        {
            if(viz[v[nod][i]]==0)
            {
                viz[v[nod][i]]=viz[nod]+1;
                c.push(v[nod][i]);
            }
        }
    }
}
int main()
{
    int i, n, m, s, x, y;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    bfs(s);
    for(i=1;i<=n;i++)
    {
        fout<<viz[i]-1<<" ";
    }


    return 0;
}