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]: 2, 5, ['W', 'A', 'm', 'w', 'r', '9705', '1729', 'U', '2171', 'Q', 'Y', 'P', 'O']
[A]: 0


[Q]: 1, 2, ['8235', 's']
[A]: 8235


[Q]: 2, 13, ['9213', 'Y', '6065', '2199', 'm', 'V', 'c', '791', 'X', 'W', 'i', '9249', 'D', 'A', '7143', '9701', '3781', 'V']
[A]:
18304