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]

[[4, -119, -5, 16, -97], [-189, 64, 89, 8]]
[16, 89]

[[-27, -144, 3, -138, -180], [58, -144, 94, 81, 27, -22, 90], [44, -158, 11, -15, -113, -108, -186], [34, 86, -132, -116, -174, -64, 44], [-139, -145, 12, -21, -138, 76, -130], [-39, 43, -184, -42]]

[3, 94, 44, 86, 76, 43]