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]: 4, 4, ['2107', 'l', '7551', '4907']
[A]: 4907


[Q]: 3, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']
[A]: 14032


[Q]: 1, 8, ['D', '1285', '5209', '1711', '9729', 'C', '2863', '9595', 'F', 'f', '8515', 'g', 'e', '2363']
[A]:
30392