{"raw_statement":[{"iden":"problem statement","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."},{"iden":"constraints","content":"*   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)$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$n$ $a$ $b$"},{"iden":"sample input 1","content":"4 1 3"},{"iden":"sample output 1","content":"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."},{"iden":"sample input 2","content":"1000000000 141421 173205"},{"iden":"sample output 2","content":"34076506\n\nPrint the count modulo $(10^9 + 7)$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}