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.

Example Input: [[-23, 34], [-9, -35, 39, -132, -43], [-195, 62, -128, -159, 62, -122, -109], [-98, 66, 28], [-48, 38], [-85, -91, -181, -129], [-125, -140, -162, -66, -2], [-196, -53, -117]]
Example Output: [34, 39, 62, 66, 38, -85, -2, -53]

Example Input: [[-15, 9, -181, -172, -74], [-164, -77, 1, -65, 29, -113, -163], [-189, -106, 22, -40, -50, -48], [-77, -61, 16, 85, 36, -45, -26], [2, 77, -77], [-146, -87, 75, -163, -147]]
Example Output: [9, 29, 22, 85, 77, 75]

Example Input: [[56, -139], [35, -20, -157], [-61, -77, 44, 19, 45], [-63, -128], [9, 79, 13], [77, -37, -31, 36, -47, -79], [13, -69, -34, 10]]
Example Output:
[56, 35, 45, -63, 79, 77, 13]