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:
[[20, 65, 13, -95, -32, -125, -94], [-133, -105, -155], [20, 61, -12, 47], [71, 82, 50, -151, -30], [-1, 80, 98, 2, -145, -21, -67]]

Ex Output:
[65, -105, 61, 82, 98]


Ex Input:
[[77, 52], [-25, -37, 13, 77, 88, -15, -158], [60, 86, -7], [78, 7, -132], [99, -94, -185, -158], [34, -90, 83, -81], [-21, -63, -161, 47, 12, 95], [59, 29], [-45, -57, 96, -170, 76, -70]]

Ex Output:
[77, 88, 86, 78, 99, 83, 95, 59, 96]


Ex Input:
[[49, -133, -169, -12, 42, -97], [6, 97, -112]]

Ex Output:

[49, 97]