import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; import java.io.OutputStream; import java.util.StringTokenizer; import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.HashMap; import java.util.Map; import java.util.ArrayList; import java.util.List; import java.util.Scanner; import java.math.BigDecimal; /** * Built using CHelper plug-in * Actual solution is at the top */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); Task solver = new Task(); solver.solve(1, in, out); out.close(); } static class Task { public void solve(int testNumber, InputReader in, PrintWriter out) { int[] A = new int[2]; int[] B = new int[2]; A[0]= in.nextInt(); A[1]= in.nextInt(); B[0]= in.nextInt(); B[1]= in.nextInt(); int C=in.nextInt(); int D=in.nextInt(); int tmp = A[1]; int res =Math.max(C-tmp,0); A[0] -= res; A[1] = Math.max(tmp-C,0); B[0] += res; B[1] += Math.min(C,tmp); tmp = B[0]; B[0] = Math.max(tmp-D,0); B[1] -= Math.max(D-tmp,0); A[0] += Math.min(D,tmp); A[1] += Math.max(D-tmp,0); out.println(A[0]); } } static class InputReader { public BufferedReader reader; public StringTokenizer tokenizer; public InputReader(InputStream stream) { reader = new BufferedReader(new InputStreamReader(stream), 32768); tokenizer = null; } public String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } } }