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.

9, 21, ['Z', 'Z', '853', '8745', 'L', '4401', 'a', 'L', '8237', 'h', '9163', '1891', '5049', '7075', '1437', '7377', 'E', 't', '837', 'B', 'z', '5629', 'm', 'z', '365', 'M', '8877', '27']
41066

11, 11, ['1049', 'a', '7521', 'f', 'Z', '2973', '7245', 'e', '1807', 'e', '1325', '7327', 'r']
1325

2, 3, ['5027', '263', '2687', 'd', 'b', 'Q', 'F', '3875', 'n', '3359', 'Y', 'b', 't', 'Q', '4003', 'u']

2950