#include <bits/stdc++.h>
using namespace std;
long long solve(long long x) { return (x + 1) * (x + 2) >> 1; }
int main() {
  long long a, b, c, l;
  scanf("%I64d%I64d%I64d%I64d", &a, &b, &c, &l);
  long long nr = (l + 1) * (l + 2) * (l + 3) / 6;
  for (long long i = 0; i <= l; i++) {
    if (a + i >= b + c) nr -= solve(min(l - i, a + i - b - c));
    if (b + i >= a + c) nr -= solve(min(l - i, b + i - a - c));
    if (c + i >= a + b) nr -= solve(min(l - i, c + i - a - b));
  }
  printf("%I64d\n", nr);
  return 0;
}
