{"raw_statement":[{"iden":"problem statement","content":"You are given integers $N$ and $K$. Find the number of triples $(a,b,c)$ of positive integers not greater than $N$ such that $a+b,b+c$ and $c+a$ are all multiples of $K$. The order of $a,b,c$ does matter, and some of them can be the same."},{"iden":"constraints","content":"*   $1 \\leq N,K \\leq 2\\times 10^5$\n*   $N$ and $K$ are integers."},{"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":"9\n\n$(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1)$ and $(3,3,3)$ satisfy the condition."},{"iden":"sample input 2","content":"5 3"},{"iden":"sample output 2","content":"1"},{"iden":"sample input 3","content":"31415 9265"},{"iden":"sample output 3","content":"27"},{"iden":"sample input 4","content":"35897 932"},{"iden":"sample output 4","content":"114191"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}