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: [[64, -108], [42, 76, -28, -11, 28], [-37, -188, -155, 73, -137, 29], [-159, 66, 72, 95, -81], [-176, 24], [89, -106, 36, -126, -155], [-194, 39, -96, -11]]
Example Output: [64, 76, 73, 95, 24, 89, 39]

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: [[-76, 100, -84], [-91, -180, 47, -31, -34, -163], [-100, -38, -90, -185], [-138, 41, 94], [-7, -189, -90, -88]]
Example Output:
[100, 47, -38, 94, -7]