#include <bits/stdc++.h>
using namespace std;
int a, b, c, l;
long long find(int a, int b) {
  long long cnt = 0;
  for (int i = 0; i <= l; i++) {
    int x = min(l - i, a - b + i);
    if (x >= 0) cnt += (long long)(x + 2) * (x + 1) / 2;
  }
  return cnt;
}
int main() {
  cin >> a >> b >> c >> l;
  long long ans = (long long)(l + 3) * (l + 2) * (l + 1) / 6;
  long long tmp = 0;
  tmp += find(a, b + c);
  tmp += find(b, a + c);
  tmp += find(c, a + b);
  cout << ans - tmp << endl;
  return 0;
}
