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:
[[-66, 28, 82], [-35, -54, -44, -53], [-63, -113, -78, 37], [86, -109, -120, -170, 86, -140, -145], [-11, -66, -144, -153, 1], [-6, 19, -196, -65, -71, 46, -29], [-198, 99, 45, 44, 64]]

Ex Output:
[82, -35, 37, 86, 1, 46, 99]


Ex Input:
[[-51, -127, -52, 18], [-38, 41, -100, -130, -50, 79, 5], [47, -98, -37, 34, -174, -191], [72, -2, -148, -38, -61]]

Ex Output:
[18, 79, 47, 72]


Ex Input:
[[30, 61, 65, -103, -107, 91], [92, 65, -192, 48], [-44, -138, -187, -151, 62, -162, 58], [-107, -156, -49, -191], [-185, -171], [-184, -38, -84, 22, -30, -177, -92], [-114, 5, -119, -180, -16, -17], [28, -5, -85, 85, -124]]

Ex Output:

[91, 92, 62, -49, -171, 22, 5, 85]