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: [[-91, 65, -182, -89, -129, 10, 64], [-65, 7, 2, 67, -160], [-176, -15, -177, 98, -49, -7], [-138, 46, -133, -190, -46, -187, 47], [76, 14, 42, -105, -142, -54], [-168, -16, -105, -95], [-148, 44, -18, 91, 23, -38], [56, 64, -189, -50]]
Example Output: [65, 67, 98, 47, 76, -16, 91, 64]

Example Input: [[76, -10, 56], [-177, -39, -40, 29, -17], [17, 77, 94, 58, 88, 39], [-2, 94, -166, -183, -48]]
Example Output: [76, 29, 94, 94]

Example Input: [[63, 38, 27], [-13, -164, -22, -129, -173, -158, -99], [-117, -83, -57, -93], [-134, 29, -11, -142, 57, -46, -12], [-64, -31, -36, -72]]
Example Output:
[63, -13, -57, 57, -31]