In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[-200, -129, -111, -123, 3, 25], [-116, 56], [-185, -154, 12, -110], [-66, -86, 75, -111], [28, -127], [-85, 40, -61, -15, -153, 0], [-143, -166], [-94, -134, 41, -66], [-45, 95, 10, 38, -148, -150]]