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: [[85, -28, -180, -71, 2], [-115, -8, -40], [67, -109, -131, -27, -24, -119], [-16, 45, 25], [-135, -11, 29, -67, 71], [-66, -101, -181, -180, 91, -72, -153]]
Example Output: [85, -8, 67, 45, 71, 91]

Example Input: [[-113, 36, -122, -72, -47], [-168, -23], [76, 65, -142], [-181, 20]]
Example Output: [36, -23, 76, 20]

Example Input: [[-86, -185, 34], [-158, 60, -17, -185], [-149, -123, -155], [42, 20, 72], [-5, 100, 33, 22, -23, -64], [38, -32, 6, 3, -195, -7, -117], [97, -200, -198, 59]]
Example Output:
[34, 60, -123, 72, 100, 38, 97]