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.
[[65, -53, -111], [-119, -59, -184, -154, 100], [-64, -89, -115], [-84, -84, -55, 40], [44, -75, -26], [52, -31, -42, -90, 2, 91], [-74, -144, -81, 8, -89, -137], [-171, -129, -193, -10, -103]]