https://codeforces.com/contest/786/problem/B

//#include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <set>
#include <list>
#include <map>
#include <cstdlib>
#include <bitset>
#include <limits.h>
using namespace std;
//#define int long long
//#define double long double
#define fi first 
#define se second
#define INF 0x3f3f3f3f3f3f3f3f
#define inf 0x3f3f3f3f
#define FILL(a,b) (memset(a,b,sizeof(a)))
#define ios std::ios::sync_with_stdio(false);std::cin.tie(0);std::cout.tie(0);
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define pb push_back
#define all(x) x.begin(),x.end()
#define SZ(x) x.size()
#define endl '\n'
#define rep(i,j,k,l) for(int i=j;i<=k;i+=l)
#define per(i,j,k,l) for(int i=j;i>=k;i-=l)
#define Rep(i,j,k,l) for(int i=j;i<k;i+=l)
#define Per(i,j,k,l) for(int i=j;i>k;i-=l)
#define ls (u<<1)
#define rs (u<<1|1)
const int N=100010,M=1e7+10,mod=998244353,pos=5e5;
const double eps=1e-8;
typedef long long ll;
typedef pair<ll,int> PII;
typedef pair<double,double> PDD;
int n,m,S;
struct{
    int l,r;
}tr[N<<3];
int h[N<<3],e[M],ne[M],w[M],idx;
int mp[N];
ll dis[N<<3];
bool st[N<<3];
void add(int a,int b,int c)
{
    e[idx]=b,w[idx]=c,ne[idx]=h[a],h[a]=idx++;
}
void dijkstra()
{
    FILL(dis,0x3f);
    priority_queue<PII,vector<PII>,greater<PII>> q;
    dis[mp[S]]=0;
    q.push({0,mp[S]});
    while(q.size())
    {
        auto t=q.top();
        q.pop();
        int ver=t.se;
        if(st[ver]) continue;
        st[ver]=1;
        for(int i=h[ver];i!=-1;i=ne[i])
        {
            int j=e[i];
            if(dis[j]>dis[ver]+w[i])
            {
                dis[j]=dis[ver]+w[i];
                q.push({dis[j],j});
            }
        }
    }
}
void build(int u,int l,int r)
{
    tr[u]={l,r};
    if(l==r)
    {
        mp[l]=u;
        return;
    }
    int mid=l+r>>1;
    add(pos+u,pos+ls,0);
    add(pos+u,pos+rs,0);
    add(ls,u,0);
    add(rs,u,0);
    build(ls,l,mid);
    build(rs,mid+1,r);
}
void modify(int u,int l,int r,int v,int w,int op)
{
    if(tr[u].l>=l&&tr[u].r<=r)
    {
        if(op==2) add(v,u+pos,w);
        if(op==3) add(u,v+pos,w);
        return;
    }
    int mid=tr[u].l+tr[u].r>>1;
    if(l<=mid) modify(ls,l,r,v,w,op);
    if(r>mid) modify(rs,l,r,v,w,op);
}
void solve()
{
    FILL(h,-1);
    cin>>n>>m>>S;
    build(1,1,n);
    for(int i=1;i<=n;i++)
    {
        add(mp[i],mp[i]+pos,0);
        add(mp[i]+pos,mp[i],0);
    }
    while(m--)
    {
        int op,u,v,l,r,w;
        cin>>op;
        if(op==1) 
        {
            cin>>u>>v>>w;
            add(mp[u],mp[v]+pos,w);
        }
        else 
        {
            cin>>v>>l>>r>>w;
            modify(1,l,r,mp[v],w,op);
        }
    }
    dijkstra();
    for(int i=1;i<=n;i++) 
        if(dis[mp[i]]==INF) cout<<-1<<" ";
        else cout<<dis[mp[i]]<<" ";
}
signed main()
{
    ios
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}