Let b_1 b_2 b_3 b_4 be a 4-element permutation with b_i ∈{1,2,3, … …, 100} for 1 ≤ i ≤ 4 and b_i ≠ b_j for i ≠ j, such that either b_1, b_2, b_3 are…

Let $\displaystyle \mathrm{b}_1 \mathrm{~b}_2 \mathrm{~b}_3 \mathrm{~b}_4$ be a $\displaystyle 4$-element permutation with $\displaystyle \mathrm{b}_i \in\{1,2,3, \ldots \ldots, 100\}$ for $\displaystyle 1 \leq i \leq 4$ and $\displaystyle \mathrm{b}_i \neq \mathrm{b}_j$ for $\displaystyle i \neq j$, such that either $\displaystyle \mathrm{b}_1, \mathrm{~b}_2, \mathrm{~b}_3$ are consecutive integers or $\displaystyle \mathrm{b}_2, \mathrm{~b}_3, \mathrm{~b}_4$ are consecutive integers. Then the number of such permutations $\displaystyle \mathrm{b}_1 \mathrm{~b}_2 \mathrm{~b}_3 \mathrm{~b}_4$ is equal to \_\_\_\_.