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.

[[98, -129, 10], [-55, -168, -73, -44, -68], [-177, 91, 98, 7, -39, 85], [-26, -129, -100, 19], [-154, -80, -1], [50, -171, 3], [49, -164, 98, -108, 9, -18, -176], [-81, -17], [-30, 48, -122, -134]]
[98, -44, 98, 19, -1, 50, 98, -17, 48]

[[-173, -53, -182, -135, -193, -186], [-160, -98, -103], [17, -38, 36, -50, -36]]
[-53, -98, 36]

[[-91, -8, -169, -187, -42], [-186, -19], [5, 83, 37, -34, -123, -2, -121], [-70, -43, 2, -108, -152, -188], [-98, -25, -128], [38, -144, 29]]

[-8, -19, 83, 2, -25, 38]