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.

[[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]
[27, 65, -27, -9, -26, -33]

[[95, -34, -73, 46, 51, -185, -192], [-43, -56, -90, -52], [59, 91], [90, 18, 33, -33, -62, -52]]
[95, -43, 91, 90]

[[-18, -96, 70, -149, -25, 53, 5], [-68, 97, 54], [-71, -150, 46, -184, -195, -104, -36], [-113, 17, -89, -103, -45, 12, -4], [59, -155, -1], [42, -120, -198, -73], [-110, -186, -135, 63, 31, 4]]

[70, 97, 46, 17, 59, 42, 63]