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.
[[-83, -90, -129, -159], [-64, -72, -85, -165, -132, -101], [-168, 10, -148, -184], [-156, 0, 74, -135, 13], [-40, -196, -177, 32, -43, 30], [-198, -147, -183, 23, -97, 49, 65], [13, -52, -39, -74, -41, -102, -57], [35, -39, -29, -86, 44, -85, 70], [-154, -123, 2, -42]]