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.
[[26, -44, -111], [-81, -35, -175, 76, 60], [-10, -38], [17, 22, -63], [-18, -39, -133, -150, -60, -127, 86]]