To test if a large base-10 integer $N$ is divisible by 101, a mathematician groups the digits of $N$ from right to left into two-digit blocks: $B_0, B_1, B_2, \dots$. Which of the following operations on these blocks yields a result that is congruent to $N \pmod{101}$?