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.
[[69, -47, 57], [-43, -84, -15, -29, -168, -114, -194], [-115, -109, 16, -54, 71], [-152, -108, -99, -124, -128, 53], [19, -6, 50, -194, -74, -82], [28, 85], [-191, -185, -18], [-34, 43, -100, 32, -78, -6, -42], [9, -107, -41, -141, -177, -125]]