{"problem":{"name":"When I hit my pocket...","description":{"content":"Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly $K$ times in total, in the order he likes: *   Hit his pocket, which magical","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"yahoo_procon2019_qual_c"},"statements":[{"statement_type":"Markdown","content":"Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly $K$ times in total, in the order he likes:\n\n*   Hit his pocket, which magically increases the number of biscuits by one.\n*   Exchange $A$ biscuits to $1$ yen.\n*   Exchange $1$ yen to $B$ biscuits.\n\nFind the maximum possible number of biscuits in Snuke's pocket after $K$ operations.\n\n## Constraints\n\n*   $1 \\leq K,A,B \\leq 10^9$\n*   $K,A$ and $B$ are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$K$ $A$ $B$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"yahoo_procon2019_qual_c","tags":[],"sample_group":[["4 2 6","7\n\nThe number of biscuits in Snuke's pocket after $K$ operations is maximized as follows:\n\n*   Hit his pocket. Now he has $2$ biscuits and $0$ yen.\n*   Exchange $2$ biscuits to $1$ yen. his pocket. Now he has $0$ biscuits and $1$ yen.\n*   Hit his pocket. Now he has $1$ biscuits and $1$ yen.\n*   Exchange $1$ yen to $6$ biscuits. his pocket. Now he has $7$ biscuits and $0$ yen."],["7 3 4","8"],["314159265 35897932 384626433","48518828981938099"]],"created_at":"2026-03-03 11:01:14"}}