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:
[[-60, -149, -20], [31, -93, -100, -187, -19, 18, 93], [-171, 17], [-97, -86, -188, -76, 91], [5, 69, -169], [-148, 44], [-180, -21, -51, -198], [-193, -197, -103, 98, 80, -148], [-158, -43, 25, -150, -153]]

Ex Output:
[-20, 93, 17, 91, 69, 44, -21, 98, 25]


Ex Input:
[[-134, -48, 4, 24, 71, -187, -166], [44, 10, 44, -55], [-63, -29, 15, -89, 78, 63, -106], [-112, -11, -134, 87, -46], [-128, -93, 68, -87], [-147, -63, 91]]

Ex Output:
[71, 44, 78, 87, 68, 91]


Ex Input:
[[-27, -129, -67, -81, 1], [34, -157, -107], [45, 94, -120, -37, -3, -71], [-174, 35, 84, -138], [89, -134, 42]]

Ex Output:

[1, 34, 94, 84, 89]