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.
[[86, -149, 39, -16, -15, 62, -71], [-25, 39, -89, -97, -23], [-29, -36], [-30, -58]]