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:
[[53, -34, -71, -43, -141, -174, -73], [5, -80, -181, -140, -63, -86, 34], [-86, -1, 91, 15, -191], [-171, 1, -62, 9, -161, 40, 35]]

Ex Output:
[53, 34, 91, 40]


Ex Input:
[[97, -79, -195, 1, -45, -140], [-172, -37, -72], [70, 17, 83, -49]]

Ex Output:
[97, -37, 83]


Ex Input:
[[100, 30, 33, -166, -28], [52, -194, 55, 92, -82, -166], [84, -94, 53, -189, 28], [-166, -41], [-131, 74], [-60, 80, 45, -84, 4, 68], [-164, -149], [69, -149, -52, 7, -99, 47]]

Ex Output:

[100, 92, 84, -41, 74, 80, -149, 69]