#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()


struct Edge {
    int to, cost, nm;
    Edge(int to, int cost, int nm): to(to), cost(cost), nm(nm) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
const int INF = 100000000;

int GCD(int a, int b){
    if(a < b) swap(a, b);
    if(b == 0) return a;
    return GCD(b, a%b);
}

bool cmp(const pii& a, const pii& b){
    if(a.first == b.first){
        return a.second < b.second;
    }
    return a.first < b.first;
}

int main() {
    //cout << fixed << setprecision(15);

    int N, M, L;
    while(cin >> N >> M >> L){
        if(N==0 && M==0 && L==0) break;

        vector<vector<Edge>> G(110);
        REP(i, M){
            int A, B, D, E; cin >> A >> B >> D >> E;
            A--;
            B--;
            Edge e(B, D, E);
            G[A].push_back(e);
            Edge e2(A, D, E);
            G[B].push_back(e2);
        }

        int dist[110][110]; // i番目の場所におり, かつ予算がjのときの最小被害
        for(int i=0; i<110; ++i) for(int j=0; j<110; ++j) dist[i][j] = INT_MAX;

        dist[0][L]=0;

        queue<pii> q;
        q.push({0, L});

        while(q.size()){
            pii p = q.front();
            q.pop();

            int v = p.first;
            int nokori = p.second;

            for(int i=0; i<G[v].size(); ++i){
                Edge e = G[v][i];

                int u = e.to;
                if(dist[u][nokori]> dist[v][nokori]+e.nm){
                    dist[u][nokori] = dist[v][nokori] + e.nm;
                    q.push({u, nokori});
                }

                if(nokori - e.cost >= 0 &&  dist[u][nokori-e.cost] > dist[v][nokori]){
                    dist[u][nokori-e.cost] = dist[v][nokori];
                    q.push({u, nokori-e.cost});
                }
            }
        }

        int minV = 10000000;
        for(int i=0; i<=L; ++i){
            minV = min(minV, dist[N-1][i]);
        }
        cout << minV << endl;
    }
    return 0;
}


Measured memory_bytes: 3276