#include <bits/stdc++.h>
using namespace std;
int l;
long long solve(int a, int s) {
  long long res = 0;
  for (int i = l; ~i; i--) {
    if (s > a + i) break;
    int t = min(l - i, a + i - s);
    res += 1ll * (t + 2) * (t + 1) / 2;
  }
  return res;
}
int main() {
  int a, b, c;
  scanf("%d%d%d%d", &a, &b, &c, &l);
  long long ans = 1ll * (l + 3) * (l + 2) * (l + 1) / 6;
  ans -= solve(a, b + c) + solve(b, a + c) + solve(c, a + b);
  cout << ans;
  return 0;
}
