// Arup Guha
// 5/11/2016
// Solution to 2016 USACO Bronze January Problem: Promotion Counting

import java.util.*;
import java.io.*;

public class promote {

	public static void main(String[] args) throws Exception {

		// Read in data.
		BufferedReader stdin = new BufferedReader(new FileReader("promote.in"));
		int[][] sizes = new int[4][2];
		for (int i=0; i<4; i++) {
            StringTokenizer tok = new StringTokenizer(stdin.readLine());
            for (int j=0; j<2; j++)
                sizes[i][j] = Integer.parseInt(tok.nextToken());
		}

        // Just work backwards.
        int platinum = sizes[3][1] - sizes[3][0];
        int gold = sizes[2][1] - sizes[2][0] + platinum;
        int silver = sizes[1][1] - sizes[1][0] + gold;

		// Write result.
		PrintWriter out = new PrintWriter(new FileWriter("promote.out"));
		out.println(silver);
		out.println(gold);
		out.println(platinum);
		out.close();
		stdin.close();
	}
}