You are given two integers n and k.

An integer x is defined as compatible with n if the bitwise AND operation between n and x equals $0$ (that is, n & x == 0).

Return the sum of all positive integers x in the range $[\max(1, n - k), n + k]$ that are compatible with n. If no such integers exist, return $0$.

Constraints:

• $1 \le$ n $\le 100$

• $1 \le$ k $\le 100$

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.