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:
[[-163, -129, -176, 12], [-28, -195, -125, -107, 23, 69], [-128, -129, -47, -30], [-53, -56, -32, -67, -7, -81, -156]]

Ex Output:
[12, 69, -30, -7]


Ex Input:
[[-100, -43, 9], [-4, -170, 48, -129, 49, 83], [41, -102, -98, 81], [27, -183, 93, 47, -13, 51], [2, -61, -170, -73, 48], [2, -118, -152, -141], [-168, -73, -166], [15, 50, 32, 4]]

Ex Output:
[9, 83, 81, 93, 48, 2, -73, 50]


Ex Input:
[[-51, -1, -125, 45, 38, 0, -57], [-21, 67], [-5, -136, 48, 52, -39], [-157, -9, -112, -190, -52], [86, -16], [-170, -20, -57, 8], [98, 76], [36, -122, 61, -42, 51, -30, 57]]

Ex Output:

[45, 67, 52, -9, 86, 8, 98, 61]