input: Write a function to find all the numbers divisible by a certain number within a certain range. The function should take three parameters: the start of the range (inclusive), the end of the range (inclusive), and the divisor. Return a list of all numbers in the specified range that are divisible by the divisor.
  
  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(1, 10, 2) == [2, 4, 6, 8, 10]
  assert find_numbers_divisible_by(15, 30, 5) == [15, 20, 25, 30]
  assert find_numbers_divisible_by(10, 20, 3) == [12, 15, 18]
  assert find_numbers_divisible_by(7, 7, 7) == [7]
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