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: [[-53, -85, 38, -82, 24, -165], [7, -123, -175, -193, 66, -76, -109]]
Example Output: [38, 66]

Example Input: [[-91, 65, -49, -154, 28, -142, -87], [-160, 76], [-167, -128, 0, 48, -191, -67], [68, -42, -6, 65, -108, -130], [-77, -5], [26, 27, -155, 51, 17, -90], [-89, -171], [-42, -169, 66, -97, 72, 78], [-90, -102, 95, -74, 66]]
Example Output:
[65, 76, 48, 68, -5, 51, -89, 78, 95]