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.

[[-6, -62], [-113, -61, -143, 51, -4, -120, -139], [-158, -24, 22, 71], [98, -148, 36, -108, -144], [-30, -122, -47], [26, 11, -59, -47, -95]]
[-6, 51, 71, 98, -30, 26]

[[-2, -170, -178, -115], [52, 57, -200, -86, 14, 31, -19], [-121, 20, -2, -173, -85, -115, 97], [30, -119, -33], [-40, -53, 24, -133, -196]]
[-2, 57, 97, 30, 24]

[[-154, -8, -79, 40, -3, -2, -142], [91, 98, 10, -85, -25], [-169, 19, 77, 99, -102, 88], [-128, 93, 30]]

[40, 98, 99, 93]