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.
[[-8, -44, 62, 70], [-8, 45, 39, -134, 45], [-115, -101, 78, -1, 94, -110], [15, -45, -49], [-50, 52, -89, -108, -33], [-62, -162, -58, 100, 7], [-147, -193, -103, 78, -100], [-18, -23, -56, -105, -169, -60, 21], [-145, 2, 9, -105, -94, 90]]