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.

[[-138, 71, -27, -83], [-80, -136, 28, 70], [33, -23, -79, -51, -127]]
[71, 70, 33]

[[-184, -9, -39, 19, -2], [-122, -141, -96, -147], [-100, -186, 60, 52], [43, 38, -18, -20, -150, -40, 50], [63, -70, -158], [58, 38, 42, -13, -61, 30, -129], [1, 92, -75, 2, -7, -88], [-63, -192, -194, 44, 67, 20, -100]]
[19, -96, 60, 50, 63, 58, 92, 67]

[[67, -171, -63, 65], [67, -61, -76, -168, 36, -114, -70], [40, 32, -64, -99, -194, -34, 33]]

[67, 67, 40]