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:
[[-12, 25, 90, -161, -90, -10, -71], [5, -63, -36, 98, -7], [20, -168, 22, -198], [-89, 83, -185, -69, -110, 85], [-7, -27, 3, 64, -132, 36, -40], [37, 68, 77, -51], [-143, 48, -53, 6, 63, 58], [-162, -152]]

Ex Output:
[90, 98, 22, 85, 64, 77, 63, -152]


Ex Input:
[[-198, -161], [66, 7, 92, 36, -103, -44], [-121, 33, 33, -183, 81, -87, 6], [-125, 1, -186]]

Ex Output:
[-161, 92, 81, 1]


Ex Input:
[[-11, -42, -107, -154, -8, -110, 74], [81, -47, 64, -135, 69], [-39, 94, -135, -105], [-30, 58, 69, -175, 10, 94, -176], [20, -54, 32, 95, -113], [-192, -156, -9, -136, 84, -77, -128], [-11, -183, 14, -50, -56, -122], [83, -70], [46, -137, 70, 28, 25, -176, -103]]

Ex Output:

[74, 81, 94, 94, 95, 84, 14, 83, 70]