#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
vector<int> g[100005];
int sol[100005];
bool ver[100005];
void bfs(int nod)
{
    queue<int> q;
    int a;
    ver[nod]=true;
    q.push(nod);
    while(!q.empty())
    {
        a=q.front();
        q.pop();
        for(auto it: g[a])
        {
            if(ver[it]==0)
            {
                ver[it]=1;
                q.push(it);
                sol[it]=sol[a]+1;
            }
        }
    }
}
int main()
{
    int n,m,s,i,x,y;
    cin>>n>>m>>s;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y;
        g[x].push_back(y);
    }
    bfs(s);
    for(i=1; i<=n; i++)
    {
        if(ver[i])
           cout<<sol[i]<<" ";
        else
           cout<<-1<<" ";
    }
    return 0;
}