{"problem":{"name":"Bouquet","description":{"content":"Akari has $n$ kinds of flowers, one of each kind. She is going to choose one or more of these flowers to make a bouquet. However, she hates two numbers $a$ and $b$, so the number of flowers in the bou","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc156_d"},"statements":[{"statement_type":"Markdown","content":"Akari has $n$ kinds of flowers, one of each kind.\nShe is going to choose one or more of these flowers to make a bouquet.\nHowever, she hates two numbers $a$ and $b$, so the number of flowers in the bouquet cannot be $a$ or $b$.\nHow many different bouquets are there that Akari can make?\nFind the count modulo $(10^9 + 7)$.\nHere, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.\n\n## Constraints\n\n*   All values in input are integers.\n*   $2 \\leq n \\leq 10^9$\n*   $1 \\leq a < b \\leq \\textrm{min}(n, 2 \\times 10^5)$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$n$ $a$ $b$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc156_d","tags":[],"sample_group":[["4 1 3","7\n\nIn this case, Akari can choose $2$ or $4$ flowers to make the bouquet.\nThere are $6$ ways to choose $2$ out of the $4$ flowers, and $1$ way to choose $4$, so there are a total of $7$ different bouquets that Akari can make."],["1000000000 141421 173205","34076506\n\nPrint the count modulo $(10^9 + 7)$."]],"created_at":"2026-03-03 11:01:14"}}