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.

[[-138, -16, -188, -181, 86, -151], [56, -176, 31, -164, 39, 51]]
[86, 56]

[[-57, -10, -27, -160], [-80, -130, -16, 25], [-65, -106, 30, -104, -20, 77], [-192, -87, -49, 64, 43, 94, 82], [-81, -10, 20, -28, 79, 73, -1], [-191, -83, -113, 40, 6]]
[-10, 25, 77, 94, 79, 40]

[[34, 41, -141, -158, -97, -46], [-193, 39, -25, -30, 91], [-8, 93, 39, -152], [-87, 39, -86, 53], [76, 45, -33, -142, -95, 22]]

[41, 91, 93, 53, 76]