#include "bits/stdc++.h" using namespace std; using Graph = vector>; typedef long long ll; typedef pair P; #define rep(i,n) for (ll i = 0; i < (n); ++i) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const long long mod = 1e9 + 7; ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } int main() { ll Aw, Ab, Bw, Bb; cin >> Aw >> Ab >> Bw >> Bb; ll c, d; cin >> c >> d; ll num = max(c - Ab, 0LL); ll ans = Aw-num + min(num+Bw, d); cout << ans << endl; }