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.
[[-131, 44, 61, -178, -136, -46, 94], [-127, -88, -143, 35], [-159, -169, -82, -145, -83, 78], [-40, -102, -26, 69], [-83, -48, -170, -136, 30, -97], [-190, 50, -189, -16, -174, -69], [-101, -76, 70, -62, -43, -105], [-98, -171, -103, -10, 1, -68]]