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.

[[30, -72, 78, 12, -87, -118, 40], [-139, 17, 10, -139, -120, 53, -127], [-122, 28, -161, 93, 9, -171], [-195, 86, -34, 15, 73], [-71, -31, -147, -106]]
[78, 53, 93, 86, -31]

[[-88, 39, 100, -118, -13], [-81, -150], [38, -64, -137, -74, -27, 84]]
[100, -81, 84]

[[-164, 45], [100, -50, 90, 22, 72, 47, -98], [-128, -45, -148, 5], [82, -114, -134, -101, -42, -180, -144], [-101, -34], [-45, 11, -107, 68, 76, -136], [52, -115, 31, -119, -4, -189], [-74, 6, -106, 61, 78], [-84, -4, -200]]

[45, 100, 5, 82, -34, 76, 52, 78, -4]