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.

3, 7, ['1811', 'Z', 'C', 'x', '6171', 'W', 'N', 'L', 'h', '4497']
6171

10, 14, ['E', 'P', 'm', 'o', '4203', '657', 'Z', '9975', 'p', '4013', 'M', 'm', '7369', 'x', 'K', 's', '9411', '9787', '4293', '8229']
11382

1, 19, ['5801', 'N', '5975', 'S', '5451', 'q', '8159', '8477', 'i', 'S', '4009', '9569', '8217', '1105', 'm', 'f', '7415', '6417', '153', '9735', '4547', 'r', '8371', '7553', 'w', 'A', '8139']

70748