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.

[[86, -31, -176, -88, -177, -127, -143], [27, -44, 46, -174, -181, -86, -88], [-128, -161], [44, 81, -78, -184, -78, -146], [-72, -77, -159, 40, -30], [67, -160, -133, -91, -197]]
[86, 46, -128, 81, 40, 67]

[[82, -5, -106, 4], [92, -200, -78], [-93, -181, 63, 63], [15, -137, 27, -139], [-155, -26, -164, -24], [-98, -91, -127], [-127, -21, 47, 19, -190, 44]]
[82, 92, 63, 27, -24, -91, 47]

[[34, -22, -130, -147, -172, 83, 55], [91, -108, -48, -166, -78, -129], [-187, 10, -133, -195, 79, 45, -175], [-200, -29, -84, -72, 92], [-176, -182, -192, -5], [-166, -174, -34, -119, -41, 62], [-53, 42], [5, -112, -66, 48, -134, -148]]

[83, 91, 79, 92, -5, 62, 42, 48]