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: 11, 11, ['1049', 'a', '7521', 'f', 'Z', '2973', '7245', 'e', '1807', 'e', '1325', '7327', 'r']

A: 1325
****
Q: 9, 9, ['8633', 'O', 'N', '3323', '1975', '8707', 'c', 'm', '8357', 'A', 'n', '8931', '9021', 'i']

A: 8357
****
Q: 6, 24, ['9017', 'R', '2423', '6369', 'Y', 'n', 'l', '8305', '6903', 'J', '33', '7357', '8807', 'n', 'i', 's', 'j', '1263', '9953', '5079', '881', '2959', '3581', 's', 'j']

A:
55121
****