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:
[[-105, -7, 11, -135], [-148, -166, 11], [-160, -67, 35], [38, -54, -108, 82, 46, -10], [-82, -177, -194, -95, -75, -86, 48], [-52, -21, 47, 41, -120, 95], [-181, -142, 2, -18, -34], [0, -148], [-115, -151]]

Ex Output:
[11, 11, 35, 82, 48, 95, 2, 0, -115]


Ex Input:
[[-152, -12], [10, -52], [-104, 77], [73, -72, 72]]

Ex Output:
[-12, 10, 77, 73]


Ex Input:
[[54, -6, -73, -107, -148, -39], [9, -90], [-167, 36, 8, -1], [-6, 33, -37], [-153, -130, 9], [-113, -74, -13, 67, -61], [94, 96, -200, 36, -19], [-175, -109, -76, -108], [-188, -121, 63, 92, 67]]

Ex Output:

[54, 9, 36, 33, 9, 67, 96, -76, 92]