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.

[[-26, 27, -21, 89, 86, -164], [96, -168], [-189, -188, -69], [-14, -14, -126, 40, -65], [52, -23, -149, 17, 90], [-171, -190, 75, 40, -187, 35], [-108, 99], [-81, 98, -137, 59], [4, -13, -66, -24, 41, -68, -147]]
[89, 96, -69, 40, 90, 75, 99, 98, 41]

[[76, -185, 14, -102], [15, 67, 90, -188, -10], [88, -45, -12, 30, 90, -18], [-131, 47, -43, 0, -134], [-105, 94, 29, 2], [63, -152, -158, 92, -27, -147, -115]]
[76, 90, 90, 47, 94, 92]

[[21, -195, -34, -174, -36], [-161, -23, -144, -65], [-106, 86, -133], [-160, 65, -50], [-48, -73, 100, -56, -184], [30, -117, 59, 25, -54, -80]]

[21, -23, 86, 65, 100, 59]