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: 12, 19, ['x', 'Z', 'm', '3819', 'D', 'P', '4815', 'D', 'V', '1409', 'u', 'N', 'E', 'A', 'v', 'k', '553', '1869', '6203', '803', '4061']

A: 8625
****
Q: 2, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']

A: 1351
****
Q: 3, 3, ['W', 'I', '9063', '4591', 'f', 'Z', 'd', '6385', 'i', 'S', 'Y', 'j', 'a', '5289']

A:
9063
****