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: [[86, -199], [-148, -11, -34, -90, 76, -18], [-100, -108], [-79, -3, -49, 99, -130, -45], [27, -26, -37, -37, -100, -132, -169], [-160, -115, -48, -107]]
Example Output: [86, 76, -100, 99, 27, -48]

Example Input: [[100, -51, -22, -199, -27, 53, -65], [-12, 3, -89, -10, -85], [-180, -125, -142, -127, 97, -99, -70]]
Example Output: [100, 3, 97]

Example Input: [[96, -65, 12, -120, -99, -21, -1], [-184, 48, -185], [-155, 29, 34], [-44, -164, -140], [-66, -137, -78, -12], [-81, -89, 10, -179, -187, -67, -125]]
Example Output:
[96, 48, 34, -44, -12, 10]