{"raw_statement":[{"iden":"problem statement","content":"Snuke has $N$ integers: $1,2,\\ldots,N$. He will choose $K$ of them and give those to Takahashi.\nHow many ways are there to choose $K$ consecutive integers?"},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\leq K \\leq N \\leq 50$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$"},{"iden":"sample input 1","content":"3 2"},{"iden":"sample output 1","content":"2\n\nThere are two ways to choose two consecutive integers: $(1,2)$ and $(2,3)$."},{"iden":"sample input 2","content":"13 3"},{"iden":"sample output 2","content":"11"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}