import java.util.Scanner;


public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int bmax = 4; int fmax = 3; int rmax = 10;
		int n = scan.nextInt();
		int b; int f; int r; int v;
		int[][][] build = new int[4][3][10]; // build[b][f][r]

		for (int i = 0; i < n; i++) {
			b = scan.nextInt();
			f = scan.nextInt();
			r = scan.nextInt();
			v = scan.nextInt();
			build[b-1][f-1][r-1] += v;
		}
		for (int i = 0; i < bmax; i++) {
			for (int j = 0; j < fmax; j++) {
				for (int k = 0; k < rmax; k++) {
					System.out.print(" " + build[i][j][k]);
				}
				System.out.println();
			}
			if (i != bmax - 1) System.out.println("####################");
		}
	}

}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz