Develop a Python function to count how many numbers within a defined range of a specific series are divisible by 3.
Write a function that generates a numerical sequence starting from 1, where each subsequent iteration increases the series by appending the subsequent number. It would be as following: 1, 12, 123, 1234, ... 12345678910, 1234567891011. The function takes two parameters specifying a range (m to n inclusive) within this series and returns the count of numbers that are divisible by 3. ### Parameters - `m` (int): The starting point in the series (1 <= m <= n). - `n` (int): The ending point in the series (m <= n <= 10^5). ### Return - The function should return an integer indicating the count of numbers within the range [m, n] that are divisible by 3 without remainder. ### Examples ```python solution(2, 5) # Returns 3 solution(5, 15) # Returns 5 ```