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]: 1, 5, ['O', '4521', 'w', '6745', 'W', '7743', '4113', '7179', '9751', '2365', '9161', 'j', '1339', '6927']
[A]: 11266


[Q]: 1, 22, ['x', 'Q', 'M', 'D', 'd', '6613', '4769', '4367', '9799', 'A', 'i', 'k', '9645', 'H', '4789', '4011', '3525', 'z', 'X', 'd', '2343', 'b', 'v', 'o', 'd', '5955']
[A]:
49861


