{"raw_statement":[{"iden":"problem statement","content":"Snuke has $R$ red balls and $B$ blue balls. He distributes them into $K$ boxes, so that no box is empty and no two boxes are identical. Compute the maximum possible value of $K$.\nFormally speaking, let's number the boxes $1$ through $K$. If Box $i$ contains $r_i$ red balls and $b_i$ blue balls, the following conditions must be satisfied:\n\n*   For each $i$ ($1 \\leq i \\leq K$), $r_i > 0$ or $b_i > 0$.\n*   For each $i, j$ ($1 \\leq i < j \\leq K$), $r_i \\neq r_j$ or $b_i \\neq b_j$.\n*   $\\sum r_i = R$ and $\\sum b_i = B$ (no balls can be left outside the boxes)."},{"iden":"constraints","content":"*   $1 \\leq R, B \\leq 10^{9}$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$R$ $B$"},{"iden":"sample input 1","content":"8 3"},{"iden":"sample output 1","content":"5\n\nThe following picture shows one possible way to achieve $K = 5$:\n![image](https://img.atcoder.jp/wtf19/9ea9530037df204a84029678052ab593.png)"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}