#include <fstream>
#include<vector>
#define MAX 100003
#include<queue>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> gr[MAX];
queue <int> q;
int n,m,viz[MAX],s;
void bfs()
{
    viz[s]=1;
    q.push(s);
    int i;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(i=0;i<gr[nod].size();i++)
            if(viz[gr[nod][i]]==0)
            {
                viz[gr[nod][i]]=viz[nod]+1;
                q.push(gr[nod][i]);

            }

    }
}


int main()
{
    f>>n>>m>>s;
    int i,x,y;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        gr[x].push_back(y);
    }
    bfs();
    for(i=1;i<=n;i++)
        g<<viz[i]-1<<" ";
    return 0;
}