a = b = c = 1
x, y, z, k = [int(s) for s in input().split()]
while (a < x or b < y or c < z) and k > 0:
if k > 0 and a < x:
a += 1
k -= 1
if k > 0 and b < y:
b += 1
k -= 1
if k > 0 and c < z:
c += 1
k -= 1
print(a * b * c)#include <bits/stdc++.h>
using namespace std;
int mini,maxi,sred;
long long wynik(int a,int b,int c){
a = min(mini,a);
b = min(sred,b);
c = min(maxi,c);
//cout << a << " " << b << " " << c << '\n';
return (long long)(a+1)*(b+1)*(c+1);
}
int main(){
int x,y,z,k;
cin >> x >> y >> z >> k;
x--;
y--;
z--;
mini = min(x,min(y,z));
maxi = max(x,max(y,z));
sred = x + y + z - mini - maxi;
int a,b,c;
if(mini * 3 >= k){
a = k/3;
k -= a;
b = k/2;
c = k - b;
cout << wynik(a,b,c);
}
else{
a = mini;
k -= a;
if(k <= 2 * sred){
cout << wynik(a,k/2,k - k/2);
}
else{
cout << wynik(a,sred,k - sred);
}
}
}
1574C - Slay the Dragon | 621A - Wet Shark and Odd and Even |
1395A - Boboniu Likes to Color Balls | 1637C - Andrew and Stones |
1334B - Middle Class | 260C - Balls and Boxes |
1554A - Cherry | 11B - Jumping Jack |
716A - Crazy Computer | 644A - Parliament of Berland |
1657C - Bracket Sequence Deletion | 1657B - XY Sequence |
1009A - Game Shopping | 1657A - Integer Moves |
230B - T-primes | 630A - Again Twenty Five |
1234D - Distinct Characters Queries | 1183A - Nearest Interesting Number |
1009E - Intercity Travelling | 1637B - MEX and Array |
224A - Parallelepiped | 964A - Splits |
1615A - Closing The Gap | 4C - Registration System |
1321A - Contest for Robots | 1451A - Subtract or Divide |
1B - Spreadsheet | 1177A - Digits Sequence (Easy Edition) |
1579A - Casimir's String Solitaire | 287B - Pipeline |