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:
[[60, -29, -4, -29, 18, -10], [-36, -96], [67, -88, 94, -86, 8, -72], [68, -27, -83, -29, -109, 20], [19, 36], [-121, -64], [-165, 30, 41, -119, -11, 38]]

Ex Output:
[60, -36, 94, 68, 36, -64, 41]


Ex Input:
[[-161, -60, -171, -26, -39], [-31, -68, 0, -4], [-171, 75]]

Ex Output:
[-26, 0, 75]


Ex Input:
[[-19, -71, -32], [-132, 48], [-138, 13, 0, -182, -167, -6, -27], [13, 64], [-150, -101, 48, -93, -58, 3, 81], [-137, -22, -99, 73, 51, -97], [40, -2, -156], [-89, -167, 82, -188, -88, -59, -65]]

Ex Output:

[-19, 48, 13, 64, 81, 73, 40, 82]