input: Write a function to find all the numbers divisible by a given divisor within a certain range. The function should take three parameters: m (the start of the range), n (the end of the range), and divisor (the number by which the numbers should be divisible). If a number within the range is divisible by the divisor, it should be included in the output list. If no numbers are divisible by the divisor within the range, the function should return an empty list.
  
  assert find_numbers_divisible_by(36, 74, 6) == [36, 42, 48, 54, 60, 66, 72]
  assert find_numbers_divisible_by(10, 20, 3) == [12, 15, 18]
  assert find_numbers_divisible_by(1, 5, 7) == []
  assert find_numbers_divisible_by(0, 10, 2) == [0, 2, 4, 6, 8, 10]
  assert find_numbers_divisible_by(100, 100, 100) == [100]
output: def find_numbers_divisible_by(m, n, divisor):
      return [i for i in range(m, n+1) if i % divisor == 0]