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]: 5, 9, ['6337', 'o', '5881', 'w', 'R', 'M', 'z', 'y', 'W']
[A]: 0


[Q]: 5, 21, ['7097', 'I', '5571', 'B', '209', '409', 'O', 'd', 'L', '5395', 'K', '889', 'K', '7087', 'J', 'n', 'Z', '5567', 'V', 'b', '5239']
[A]:
24795