#include <fstream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
vector<int> d;
queue<int> q;
vector<vector<int>> adj;
int main() {
    int n,m,s,a,b;
    in>>n>>m>>s;
    adj.resize(n+1);
    d.resize(n+1);
    for(int i=1;i<=n;i++)
        d[i]=INT_MAX;
    for(int i=1;i<=m;i++)
    {
        in>>a>>b;
        adj[a].push_back(b);

    }
    d[s]=0;
    q.push(s);
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(int y:adj[x])
        {
            if(d[y]==INT_MAX)
            {
                d[y]=1+d[x];
                q.push(y);
            }
        }
    }
    for(int i=1;i<=n;i++) {
        if(d[i]==INT_MAX)
            out<<"-1 ";
        else
        out << d[i] << " ";
    }
    return 0;
}