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: [[-79, -29, 95, 11, -47, -37], [-61, -14, 2, 63, 18, -44, 60], [67, -61, -152, -108, -184, 85], [-7, -135, -113, -81, -146, -34], [74, 58], [-139, 40, -181, -95], [83, -28, -200], [80, -130, -174, 36, 19], [12, 70, -198, -62]]
Example Output: [95, 63, 85, -7, 74, 40, 83, 80, 70]

Example Input: [[-88, -166, -101, -103, 12, -33], [66, 39, -15, -27, -159, 46], [15, -46, 94, -28, -25, -98], [-80, -160, -50, -120], [-146, 1, 51, 37, -88, -38], [-36, 82, -66, 73, -144, -41], [47, 1, 71, -125, -90]]
Example Output:
[12, 66, 94, -50, 51, 82, 71]