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:
[[-52, -181, 85, -185], [-188, 21], [-180, -20, 34, -164], [-161, -10, -15, 90], [81, -138, 63, -157, -175, -132], [-50, 31, -129, -101, -149, 32], [15, -108, -17, -54, 1, 77, -29], [-53, 65], [97, -33, 16]]

Ex Output:
[85, 21, 34, 90, 81, 32, 77, 65, 97]


Ex Input:
[[49, -82, -118, -198, 28, -171, -74], [-72, -35, -32, -120, -131, 24], [-92, -135], [-71, -91, 14, 80, -124, 75], [-160, -54, 19, -151, -90], [18, 48, -175, 93, 48], [100, 54, 64, -82, -190, -199], [-21, 42], [-112, 84, -196]]

Ex Output:
[49, 24, -92, 80, 19, 93, 100, 42, 84]


Ex Input:
[[-161, -75, -32, -174, 14], [-180, -140, 8, -46, -39, -90, -23], [-186, 24, 76, -167]]

Ex Output:

[14, 8, 76]