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.
[[-93, 22, 100, -159, 23], [-113, 71, -170, 51, 8, -90], [-106, -174, -167, -20, -189, -3, -139], [-12, 56, 69, -43, 69], [-61, 48, -120, -144, -97, -8, -46], [-105, -47, -168, -194], [22, -95, 71], [35, -132, -39], [-133, 33, -68, -9, -46, 61]]