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: [[-110, -173], [12, 37, -136, -70, -108], [-114, 0, -48, -74], [24, -48, -112, -166, -21, -28]]
Example Output: [-110, 37, 0, 24]

Example Input: [[-12, -187, -33, 22], [-65, -197, 84, -84], [59, 6], [-103, -195], [-190, -129, -98, -106, 98, -59], [-164, -82, -93, 65, -123], [-119, 19, 15, -118], [-113, 6, -149, -138, -198, -3], [-124, -146, 93, -15, -102, 36]]
Example Output:
[22, 84, 59, -103, 98, 65, 19, 6, 93]