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.

Ex Input:
[[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]

Ex Output:
[55, 64, 56, -31, -4, 51]


Ex Input:
[[-166, 3, -5, -99, -138, -161], [-57, -150, -165, -173, -42, -119, 15], [-56, -79, -48, 17], [-18, 57, -129, -20, -99, -111], [-120, -191, -196, -30], [-163, -24, 56], [-196, -8, 84, 62, -45, -19, 77], [63, -18, 37]]

Ex Output:
[3, 15, 17, 57, -30, 56, 84, 63]


Ex Input:
[[-132, -93, -110, -47], [83, 63, -54], [-17, -89], [38, -136, -151, -180, -40, -166], [-60, -72, 46, -151, -120]]

Ex Output:

[-47, 83, -17, 38, 46]