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:
[[-116, 74, -148, -128, 83, -15, 92], [29, -115], [-186, -195, -2, -125, -22, -120]]

Ex Output:
[92, 29, -2]


Ex Input:
[[-70, -63, 11, -65, -62], [41, -3, -20, -154, -13, 32, -116], [30, 90, -122, 12, 33], [72, -18, -151, -20, -177], [-85, 34, -87, 6, 20], [56, -153, -117, -101], [-59, 91, -123, -28, -60, -134], [-186, -162, -133]]

Ex Output:
[11, 41, 90, 72, 34, 56, 91, -133]


Ex Input:
[[-189, -187, -86], [43, 89], [-26, -50, -66, -115, -123], [51, -65, -164], [87, -143, -124, -53, -102, -185, -84]]

Ex Output:

[-86, 89, -26, 51, 87]