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]

[[-107, -152, -105, -113], [49, 56, 97, 94, -30, -19], [-56, 59, -97, -152, -86], [80, -119, -150, -199, -81, 22, -141], [-97, -110, -47], [-51, -65, -55], [-51, 9, -111, -14, -103, -59, -159], [-7, 64, 49, 70, -25, -49, -133], [-166, -40, -191, 81, 41]]
[-105, 97, 59, 80, -47, -51, 9, 70, 81]

[[-62, -117], [74, 48, -199, -24, -44], [58, 22, -153, 32, -147, -4], [-18, 42], [-53, -40, 29, -146, -117, -150, -143], [-121, -167, -54], [-128, -162, -76, 57, -143, -128], [-161, -157, -41, 95, 28, -120]]

[-62, 74, 58, 42, 29, -54, 57, 95]