You are given two positive integers, n and m.

Define two values, num1 and num2, as follows:

• num1 is the sum of all integers in the range $[1,$ n$]$ that are not divisible by m.

• num2 is the sum of all integers in the range $[1,$ n$]$ that are divisible by m.

Return the result of num1 minus num2.

Constraints:

• $1 \leq$ n, m $\leq 1000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.