#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
double PI = 4 * atan(1);
long long a, b, c, l, ans = 0;
void solve() {
  for (int i = 0; i < l + 1; i++)
    if (l - i >= max((long long)0, (a + b - c + i)))
      ans -= (i + 1) * (l - i - max((long long)0, (a + b - c + i)) + 1);
}
int main() {
  cin >> a >> b >> c >> l;
  ans = (l + 3) * (l + 2) * (l + 1) / 6;
  solve();
  swap(a, c);
  solve();
  swap(b, c);
  solve();
  cout << ans;
  return 0;
}
