{"raw_statement":[{"iden":"problem statement","content":"Snuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\n*   Red boxes, each containing $R$ red balls\n*   Green boxes, each containing $G$ green balls\n*   Blue boxes, each containing $B$ blue balls\n\nSnuke wants to get a total of exactly $N$ balls by buying $r$ red boxes, $g$ green boxes and $b$ blue boxes. How many triples of non-negative integers $(r,g,b)$ achieve this?"},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\leq R,G,B,N \\leq 3000$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$R$ $G$ $B$ $N$"},{"iden":"sample input 1","content":"1 2 3 4"},{"iden":"sample output 1","content":"4\n\nFour triples achieve the objective, as follows:\n\n*   $(4,0,0)$\n*   $(2,1,0)$\n*   $(1,0,1)$\n*   $(0,2,0)$"},{"iden":"sample input 2","content":"13 1 4 3000"},{"iden":"sample output 2","content":"87058"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}