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]: 1, 8, ['D', '1285', '5209', '1711', '9729', 'C', '2863', '9595', 'F', 'f', '8515', 'g', 'e', '2363']
[A]: 30392


[Q]: 1, 2, ['1907', '1489', 'm', '4571', 'a']
[A]: 3396


[Q]: 3, 7, ['w', '5433', '8307', '5871', 'k', '6143', '7715', 'u', 'x', 'W', 't', '8963', 'f', '5343', '9867', 'K', 'v', 'T', 'O', 'v', 'x', '2269', '6929', 'q']
[A]:
28036