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.

[[-9, -162, -58, -49, -137, 75, -173], [34, -149, -90, 9, -162, -82, -117], [81, -33, 96, 3], [33, -86, -48, 20], [-13, -67, 21, -39, -161], [-91, 50], [17, -2]]
[75, 34, 96, 33, 21, 50, 17]

[[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]
[60, -32, 68, 93, 24, 26, 7, 85]

[[-36, 11, 65, 43, -30, 70], [-151, -1, -93, 69, -192, -14], [36, -191, 14, 79, -80, -31, -188], [-56, -189, -107, -177]]

[70, 69, 79, -56]