Leetcode 3519. Count Numbers with Non-Decreasing Digits

Count how many integers in the inclusive string range [l, r] have non-decreasing digits when written in base b. This requires digit-DP / combinatorial counting over base-b digit sequences to handle large string bounds (length up to 100) and return the result modulo 1e9+7.