Go: // Warshall–Floyd Algorithm

package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		n, _ := strconv.Atoi(buf[0])
		m, _ := strconv.Atoi(buf[1])
		if n == 0 && m == 0 {
			break
		}
		c_matrix := make([][]int, m)
		for i := range c_matrix {
			c_matrix[i] = make([]int, m)
		}
		t_matrix := make([][]int, m)
		for i := range t_matrix {
			t_matrix[i] = make([]int, m)
		}
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			a, _ := strconv.Atoi(buf_[0])
			b, _ := strconv.Atoi(buf_[1])
			c, _ := strconv.Atoi(buf_[2])
			t, _ := strconv.Atoi(buf_[3])
			c_matrix[a-1][b-1] = c
			t_matrix[a-1][b-1] = t
		}
		c_dist := make([][]int, m)
		c_prev := make([][]int, m)
		t_dist := make([][]int, m)
		t_prev := make([][]int, m)
		for i := 0; i < m; i++ {
			c_dist[i] = make([]int, m)
			c_prev[i] = make([]int, m)
			t_dist[i] = make([]int, m)
			t_prev[i] = make([]int, m)
		}
		for i := 0; i < m; i++ {
			for j := 0; j < m; j++ {
				if c_matrix[i][j] == 0{
					c_dist[i][j] = INF
				} else {
					c_dist[i][j] = c_matrix[i][j]
				}
				if c_matrix[i][j] == 0{
					c_prev[i][j] = -1
				} else {
					c_prev[i][j] = i
				}
				if t_matrix[i][j] == 0{
					t_dist[i][j] = INF
				} else {
					t_dist[i][j] = t_matrix[i][j]
				}
				if t_matrix[i][j] == 0{
					t_prev[i][j] = -1
				} else {
					t_prev[i][j] = i
				}
			}
			c_dist[i][i] = 0
			t_dist[i][i] = 0
		}
		for k := 0; k < m; k++ {
			for i := 0; i < m; i++ {
				for j := 0; j < m; j++ {
					c_newlen := c_dist[i][k] + c_dist[k][j]
					t_newlen := t_dist[i][k] + t_dist[k][j]
					if c_newlen < c_dist[i][j] {
						c_dist[i][j] = c_newlen
						c_prev[i][j] = c_prev[k][j]
					}
					if t_newlen < t_dist[i][j] {
						t_dist[i][j] = t_newlen
						t_prev[i][j] = t_prev[k][j]
					}
				}
			}
		}
		scanner.Scan()
		k, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < k; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			p, _ := strconv.Atoi(buf_[0])
			q, _ := strconv.Atoi(buf_[1])
			r, _ := strconv.Atoi(buf_[2])
			switch r {
			case 0: fmt.Println(c_dist[p-1][q-1])
			case 1: fmt.Println(t_dist[p-1][q-1])
			}
		}
	}
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define INF 11451400


/*
int main(){
	while(true){
		int lineL, statL;
		cin >> lineL >> statL;
		if(lineL==0&&statL==0){return 0;}

		long leastCosts[statL][statL];
		long leastTimes[statL][statL];
		FOR(aStat,0,statL){
			FOR(bStat,0,statL){
				leastCosts[aStat][bStat] = leastTimes[aStat][bStat] = (aStat==bStat)?0:INF;
			}
		}

		REP(lineI,lineL){
			int naStat,nbStat,nCost,nTime;
			cin >> naStat >> nbStat >> nCost >> nTime;
			naStat -=1; nbStat -=1;
			FOR(aStat,0,statL){
				FOR(bStat,0,statL){
					leastCosts[aStat][bStat] = min(leastCosts[aStat][bStat] , leastCosts[aStat][naStat]+nCost+leastCosts[nbStat][bStat]);
					leastCosts[aStat][bStat] = min(leastCosts[aStat][bStat] , leastCosts[aStat][nbStat]+nCost+leastCosts[naStat][bStat]);
					leastTimes[aStat][bStat] = min(leastTimes[aStat][bStat] , leastTimes[aStat][naStat]+nTime+leastTimes[nbStat][bStat]);
					leastTimes[aStat][bStat] = min(leastTimes[aStat][bStat] , leastTimes[aStat][nbStat]+nTime+leastTimes[naStat][bStat]);
				}
			}
		}

		int reqL;
		cin >> reqL;
		REP(reqI,reqL){
			int aStat,bStat,costOrTime;
			cin >> aStat >> bStat >> costOrTime;
			aStat-=1;bStat-=1;
			if(costOrTime==0){cout<<leastCosts[aStat][bStat]<<endl;};
			if(costOrTime==1){cout<<leastTimes[aStat][bStat]<<endl;};
		}
	}
}
*/

int main(){
	while(true){
		int lineL, statL;
		cin >> lineL >> statL;
		if(lineL==0&&statL==0){return 0;}

		long leastCosts[statL][statL];
		long leastTimes[statL][statL];
		FOR(aStat,0,statL){
			FOR(bStat,0,statL){
				leastCosts[aStat][bStat] = leastTimes[aStat][bStat] = (aStat==bStat)?0:INF;
			}
		}

		REP(lineI,lineL){
			int naStat,nbStat,nCost,nTime;
			cin >> naStat >> nbStat >> nCost >> nTime;
			naStat -=1; nbStat -=1;
			leastCosts[naStat][nbStat] = nCost;
			leastTimes[naStat][nbStat] = nTime;
		}

		REP(k,statL) REP(i,statL) REP(j,statL) {
			leastCosts[i][j] = min(leastCosts[i][j] , leastCosts[i][k]+leastCosts[k][j]);
			leastTimes[i][j] = min(leastTimes[i][j] , leastTimes[i][k]+leastTimes[k][j]);
		}

		int reqL;
		cin >> reqL;
		REP(reqI,reqL){
			int aStat,bStat,costOrTime;
			cin >> aStat >> bStat >> costOrTime;
			aStat-=1;bStat-=1;
			if(costOrTime==0){cout<<leastCosts[aStat][bStat]<<endl;};
			if(costOrTime==1){cout<<leastTimes[aStat][bStat]<<endl;};
		}
	}
}

C++: #include <stdio.h>
#define INF 100000000

int main(void){
	int n,m;
	
	while(scanf("%d%d",&m,&n),n,m){
		int i,j;
		int a,b,cost,time,c;
		int DPc[256][256];
		int DPt[267][256];
		int k,ans[128],count=0;
		
		for(i=0;i<128;i++){
			for(j=0;j<128;j++){
				if(i==j){
					DPc[i][j]=0;
					DPt[i][j]=0;
				}
				else{
					DPc[i][j]=INF;
					DPt[i][j]=INF;
				}
			}
		}
		
		for(i=0;i<m;i++){
			scanf("%d%d%d%d",&a,&b,&cost,&time);
			DPc[a][b]=cost;
			DPc[b][a]=cost;
			DPt[a][b]=time;
			DPt[b][a]=time;
		}
		for(i=0;i<=n;i++){
			for(j=0;j<=n;j++){
				for(k=0;k<=n;k++){
					if(DPt[i][k]+DPt[k][j]<DPt[i][j]){
						DPt[i][j]=DPt[i][k]+DPt[k][j];
					}
					if(DPc[i][k]+DPc[k][j]<DPc[i][j]){
						DPc[i][j]=DPc[i][k]+DPc[k][j];
					}
				}
			}
		}
		
		scanf("%d", &m);
		for(i=0;i<m;i++){
			scanf("%d%d%d",&a,&b,&c);
			if(c==1){
				ans[count]=DPt[a][b];
			}
			else {
				ans[count]=DPc[a][b];
			}
			count++;
		}
		for(i=0;i<m;i++){
			printf("%d\n",ans[i]);
		}
	}
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<functional>
#include<queue>

using namespace std;

#define max_n 3000
#define INF (max_n+100)*(1000+1000)

struct edge{
	int to,cost[2]; ///cost[0] 最少金額 cost[1] 最短距離
};

typedef pair<int,int> P;

int main(void){
	int n,m,k;
	int p,q,r;
	int a,b,c,t;
	vector<edge> N[max_n];
	edge e;
	int d[max_n];
	priority_queue<P,vector<P>,greater<P> > que;
	int v;
	P pi;

	while(1){

		cin>>n>>m;
		if(n==0&&m==0) break;

		for(int i=0;i<max_n;i++) N[i].clear();

		for(int i=0;i<n;i++){
			cin>>a>>b>>c>>t;
			e.to=b,e.cost[0]=c,e.cost[1]=t;
			N[a].push_back(e);
			e.to=a;
			N[b].push_back(e);
		}
	
		cin>>k;

		for(int i=0;i<k;i++){

			cin>>p>>q>>r;

			fill(d,d+n,INF);
			d[p]=0;
			que.push(P(0,p));
			while(!que.empty()){
				pi=que.top();
				que.pop();
				v=pi.second;
				if(d[v]<pi.first) continue;
				for(int j=0;j<N[v].size();j++){
					e=N[v][j];
					if(d[e.to]>d[v]+e.cost[r]){
						d[e.to]=d[v]+e.cost[r];
						que.push(P(d[e.to],e.to));
					}
				}
			}

			cout<<d[q]<<endl;;

		}

	}

	return 0;
}