import java.awt.Point;
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
public class Main {
	public static final int INF = 1 << 30;
	public static int[][][] path;
	public static int[][] dp;
	public static int n;
	public static void main(String[] args) throws NumberFormatException, IOException{
		ContestScanner in = new ContestScanner();
		n = in.nextInt();
		int c = in.nextInt();
		int v = in.nextInt();
		path = new int[n][n][2];
		int[][] vals = new int[v][4];
		for(int i=0; i<4; i++){
			for(int j=0; j<v; j++){
				vals[j][i] = in.nextInt();
			}
		}
		for(int i=0; i<v; i++){
			path[vals[i][0]-1][vals[i][1]-1][0] = vals[i][2];
			path[vals[i][0]-1][vals[i][1]-1][1] = vals[i][3];
		}
		dp = new int[n][c+1];
		for(int i=0; i<n; i++){
			for(int j=0; j<=c; j++){
				dp[i][j] = INF;
			}
		}
//		dp[0][c] = 0;
		for(int i=0; i<=c; i++){
			dp[0][c] = 0;
		}
		for(int i=0; i<n; i++){
			for(int j=0; j<n; j++){
				if(path[i][j][0] == 0) continue;
				for(int k=c; k>=0; k--){
					int nxtM = k-path[i][j][0];
					if(nxtM < 0) break;
					dp[j][nxtM] = Math.min(dp[j][nxtM], dp[i][k]+path[i][j][1]);
				}
			}
		}
		int min = INF;
		for(int i=0; i<=c; i++){
			min = Math.min(min, dp[n-1][i]);
		}
		
		System.out.println();
		for(int i=0; i<n; i++){
			for(int j=0; j<=c; j++){
				System.out.print(dp[i][j]+" ");
			}
			System.out.println();
		}
		System.out.println();
		
		if(min == INF){
			System.out.println(-1);
			return;
		}
		System.out.println(min);
	}
	
	public static void dfs(int town, int money){
		for(int i=0; i<n; i++){
			if(path[town][i][0] == 0) continue;
			int nextM = money - path[town][i][0];
			if(nextM < 0) continue;
			int time = path[town][i][1];
			if(dp[i][nextM] <= dp[town][money]+time) continue;
			dp[i][nextM] = dp[town][money]+time;
			dfs(i, nextM);
		}
	}
}

class MyComp implements Comparator<int[]>{
	public int compare(int[] a, int[] b) {
		return a[0] - b[0];
	}
}

class Reverse implements Comparator<Integer>{
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}

class Node{
	int color;
	boolean checked;
	List<Integer> to = new ArrayList<Integer>();
	public Node(){
		checked = false;
	}
}

//class Node{
//	int id;
//	List<Node> edge = new ArrayList<Node>();
//	public Node(int id){
//		this.id = id;
//	}
//	public void createEdge(Node node){
//		edge.add(node);
//	}
//}

class ContestScanner{
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));
	}
	
	public String nextToken() throws IOException{
		if(line == null || line.length <= idx){
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	public long nextLong() throws IOException, NumberFormatException{
		return Long.parseLong(nextToken());
	}
	public int nextInt() throws NumberFormatException, IOException{
		return (int)nextLong();
	}
	public double nextDouble() throws NumberFormatException, IOException{
		return Double.parseDouble(nextToken());
	}
}