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.
[[-66, -29], [-73, -190, -82], [-174, -78, -135, -113, -26], [-192, -74, -192, 64, -134, -16, -15], [-140, -181, -179, 11], [-9, -121, -138, -143, -64, 28], [-66, -71, 60]]