In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
8, 16, ['8489', 'I', 'g', 'T', 'h', '4143', 'E', '5727', 'P', '7031', 'L', '7755', '7285', 'H', '2095', 'G', 'W', '7333', '9267', '8875', 'M', '5783']