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:
[[-76, -194, 15, 74], [-60, -20, 6], [-118, -40, 82], [-135, 13], [10, -24, -119, -62, -109], [0, 5]]

Ex Output:
[74, 6, 82, 13, 10, 5]


Ex Input:
[[-171, 49, -188, -34, -186], [-101, 34], [10, -98], [-44, 14, -6, -91, -92, 52, -111], [-79, 76, -30, -53, -129, 78, -158], [-7, -181, -163, -81, 31], [-28, -162, -154, -23, -170, 30], [18, -84]]

Ex Output:
[49, 34, 10, 52, 78, 31, 30, 18]


Ex Input:
[[-183, 89, 5], [-76, -11, -108, 70, 92, -89, -61], [53, 87], [60, 4, -17, 89, -26, 56], [-73, 49, -121, -165], [-78, -34, 98, -174, -172, -107, 49], [-41, -106, 97, -167, -126, -94], [95, -29, 88, -39, -158], [-78, -144]]

Ex Output:

[89, 92, 87, 89, 49, 98, 97, 95, -78]