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.
[[46, -115, 39, 85, 21], [75, -175, -41], [-145, -142, -54, -68, -182, -112, -154], [78, 33, -1, -108, -61, -47, -32], [35, 30, 21], [-14, 14, -55, -130, -65], [49, -90, -143, -10, -42, -53], [-90, 9]]