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:
[[55, -93, -37, 78, -196, -158, 53], [-56, -98], [-196, -173, -80], [89, -61, 79, -26, -155], [-157, -161, -158, -112], [-5, -198, -158, -81, 49, -108, 33], [-93, -117, -190, -105], [-71, 91, 87, -117], [-178, -94, -127]]

Ex Output:
[78, -56, -80, 89, -112, 49, -93, 91, -94]


Ex Input:
[[-100, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]

Ex Output:
[-66, -6, 91, 69, -24, 72]


Ex Input:
[[-150, -29, -166, -81, -193, -60], [-118, -17, -5]]

Ex Output:

[-29, -5]