#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
 
long long int INF = 2e18;
const ll fact_table = 1200008;
double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←

#define endl "\n"
#ifdef ENJAPMA
    #undef endl
#endif
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
#define pc(x) cout << x << ",";
 
const ll mod = 998244353ll;
// const ll mod = 1000000007ll;
  
ll mypow(ll number1,ll number2, ll mod){
    if(number2 == 0){
        return 1ll;
    }else{
        ll number3 = mypow(number1,number2 / 2, mod);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
void YES(bool condition){
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 
/*
ll fact[fact_table + 5],rfact[fact_table + 5]; 
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table],mod - 2, mod);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/

bool multicase = false;

ll n,m,num,a,b,c,d,e,h,q;
ll w, k, s;
vector<P> G[500005];
P station[5005];
ll x[50005];
ll cost[500005];

const ll offset = 2501;

void solve(){
    cin >> n >> m >> s;
    for(ll i=0;i<m;i++){
        cin >> a >> b >> c >> d;
        for(ll j=0;j<offset;j++){
            // a -> b
            if(j - c < 0)continue;

            ll id1 = a * offset + j;
            ll id2 = b * offset + j - c;
            G[id1].pb(P(id2, d));
        }
        for(ll j=0;j<offset;j++){
            if(j - c < 0)continue;
            ll id1 = b * offset + j;
            ll id2 = a * offset + j - c;
            G[id1].pb(P(id2, d));
        }
    }
    for(ll i=0;i<n;i++){
        cin >> a >> b;
        for(ll j=0;j<=offset;j++){
            if(j + a >= offset)continue;
            ll id1 = (i+1) * offset + j;
            ll id2 = (i+1) * offset + j + a;
            G[id1].pb(P(id2, b));
        }
    }
    if(s >= 2500)s = 2500;
    for(ll i=0;i<offset*(n+1)+2500;i++){
        cost[i] = INF;
    }
    pqps.push(P(0, offset + s));
    cost[offset+s] = 0;
    while(!pqps.empty()){
        P p = pqps.top();
        pqps.pop();
        ll v = p.second;
        ll nowcost = p.first;
        if (nowcost > cost[v])continue;
        for(ll i=0;i<G[v].size();i++){
            ll nv = G[v][i].first;
            ll newcost = cost[v] + G[v][i].second;
            if(cost[nv] > newcost){
                cost[nv] = newcost;
                pqps.push(P(newcost, nv));
            }
        }
    }
    for(ll v=2;v<=n;v++){
        ll ans = INF;
        for(ll i=0;i<offset;i++){
            ans = min(ans, cost[v*offset+i]);
        }
        p(ans);
    } 
    return;
}


int main(){
    // init();
    
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll q, testcase = 1;
    if(multicase){
        cin >> q;
    }else{
        q = 1; 
    }
    while(q--){
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }
    
    // solve();
    return 0;
}
















Measured memory_bytes: 32348