/*
    Those without power, seek us!
    Those with power, fear us!
    We are the Order of the Black Knights!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod  1999999973LL
#define DIM 60010000
#define base 256
#define bas 255
#define N 100100
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/
vector<int> v[N];
queue<int> q;
int D[N],viz[N],x,y,n,m,p;
void bfs(int x)
{
    q.push(x);
    viz[x]=1;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        FIT(it,v[x])
        if(!viz[*it])
        {
            viz[*it]=1;
            q.push(*it);
            D[*it]=D[x]+1;
        }
    }
}
int main ()
{
    f>>n>>m>>p;
    FOR(i,1,m)
    {
        f>>x>>y;
        v[x].pb(y);
    }
    bfs(p);
    FOR(i,1,n)
    g<<(D[i]==0&&i!=p?-1:D[i])<<" ";
    return 0;
}