input: Write a function to find all the numbers within a given range that are divisible by a specific divisor. Return the list of these numbers.
  def find_numbers_divisible_by(m, n, divisor):
      divisible_numbers = []
      for i in range(m, n+1):
          if i % divisor == 0:
              divisible_numbers.append(i)
      return divisible_numbers
  
  assert find_numbers_divisible_by(36, 74, 6) == [36, 42, 48, 54, 60, 66, 72]
  assert find_numbers_divisible_by(10, 20, 4) == [12, 16, 20]
  assert find_numbers_divisible_by(0, 10, 3) == [0, 3, 6, 9]
  assert find_numbers_divisible_by(15, 20, 7) == [21]
  assert find_numbers_divisible_by(50, 50, 50) == [50]
output: def find_numbers_divisible_by(m, n, divisor):
      divisible_numbers = []
      for i in range(m, n+1):
          if i % divisor == 0:
              divisible_numbers.append(i)
      return divisible_numbers