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.
[[16, 69], [-145, 15], [-144, 64, -75], [10, -151, -3], [-195, 52], [-64, -200, -17, -85, -105, 57], [-40, -188, -165, -161], [20, -117], [-83, 25, 68, -197]]