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:
[[-187, -52, -138, 33], [-32, -176, -198, -74, 66], [95, -187, 82, -51, -114]]

Ex Output:
[33, 66, 95]


Ex Input:
[[-12, 54, 78, -136, -49, 2], [-26, 86, 45, -195], [-169, -89, -72], [-153, -194]]

Ex Output:

[78, 86, -72, -153]