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.

[[-184, -18], [62, -135, 95, -110, -70], [-168, 50, 26], [-45, -110, 81, -45, -191, -146, -88], [-95, -71, -90, -174, 49], [-32, 91, -141], [-150, 13, -90, 4, -75, 94], [31, 59]]
[-18, 95, 50, 81, 49, 91, 94, 59]

[[-33, -17, 16, -125], [-15, 51, -194, -36, -4, 40], [-163, -197, -185, 99, -114, -157, 41], [35, -1, -14, -73, -149]]
[16, 51, 99, 35]

[[-102, 7, -97, -194, -190, -73, 28], [-197, -137], [-7, -94, -44, 29, -176, -107], [-46, -194, -199, -114, -139, -30, -116], [-101, -183, -90, 4, 73, 23], [-44, -182, 47, -107, 70], [-144, 1, 67, -175, 66, 17, -121], [-52, -9, 27, -165, 65, 33], [45, -26]]

[28, -137, 29, -30, 73, 70, 67, 65, 45]