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:
[[86, -199], [-148, -11, -34, -90, 76, -18], [-100, -108], [-79, -3, -49, 99, -130, -45], [27, -26, -37, -37, -100, -132, -169], [-160, -115, -48, -107]]

Ex Output:
[86, 76, -100, 99, 27, -48]


Ex Input:
[[-132, -99, 9, -38, -77], [-7, 12, -183], [-158, -194], [-166, -39], [-115, -89, -104, -80, -147], [73, -200], [51, -31], [-51, -166, 69, -131], [26, -61, 53]]

Ex Output:
[9, 12, -158, -39, -80, 73, 51, 69, 53]


Ex Input:
[[-9, 90, -55], [54, -61], [51, 83, -130, 43, 49, -190]]

Ex Output:

[90, 54, 83]