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.

[[65, 72, -140, -53, -102, -66, -171], [36, -50], [-166, 32, 12, -43], [-129, 2, -49], [-172, -124, 44, -100, -133], [89, -95, 52, 45, -102, -4]]
[72, 36, 32, 2, 44, 89]

[[78, 11, 69, -139, 60, -155, -126], [-8, 1, -98, 2, -45, -50, -53], [43, 18], [-144, -9, 74, 33, -83], [40, -125, 67, 6, 51, -145, 24], [31, 26, -4, -124, -87], [-58, -79, 40, -146], [91, -168]]
[78, 2, 43, 74, 67, 31, 40, 91]

[[79, -6, -1], [-163, -175, -58, -50, 87, -148], [17, 11, 10, -181], [-173, -119], [-116, -103, -176, 26, 29, -111, -160]]

[79, 87, 17, -119, 29]