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.

Q: 8, 9, ['6753', 'Y', 'v', '1365', '1033', 'l', 'A', '203', 'J', '8391', 'i', '1813', 'V', 'D', 'S', '4981', 'o']

A: 203
****
Q: 5, 6, ['i', 'i', 'J', 'O', '4571', 'o', '2073', '87', 'x', '9937', '9917', '4283', 'S']

A: 4571
****
Q: 2, 19, ['u', 'x', '1103', 'K', 'N', 'o', '1943', 'Z', 'r', 'B', 'N', 'e', '7289', 'S', '325', 'G', 'x', 'D', '9005', 'y', '1729', '961', '4621', 'D', 'u', '1235']

A:
19665
****