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

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int dist[100005],viz[100005];
vector<vector<int>>adjlist;

void bfs(int s)
{
    queue<int>q;
    q.push(s);
    viz[s]=1;
    while(!q.empty())
    {
        int nod;
        nod=q.front();
        for(int i=0;i<adjlist[nod].size();i++)
        {
             if(viz[adjlist[nod][i]]==0)
             {
                 viz[adjlist[nod][i]]++;
                 dist[adjlist[nod][i]]=dist[nod]+1;
                 q.push(adjlist[nod][i]);
             }
        }
        q.pop();
    }
}
int main()
{
    int n,m,s,x,y;
    fin>>n>>m>>s;
    adjlist.resize(n+1);
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        adjlist[x].push_back(y);
    }
    bfs(s);
    for(int i=1;i<=n;i++)
    {
        if(viz[i]==0)
        {
            fout<<-1<<" ";
        }
        else
        {
            fout<<dist[i]<<" ";
        }
    }
    return 0;
}