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, 10, ['H', 'P', '1985', '1797', '9115', 'V', 'o', '2405', '7817', 't', 'C']
[A]: 23119


[Q]: 3, 5, ['3515', '4581', '8863', '2037', '7899', 'N']
[A]: 18799


[Q]: 12, 18, ['8383', '9467', 'w', 'V', 'q', '4251', 'z', 'T', 's', 'V', 'c', 'N', '599', 'v', 'Y', 'L', '7647', '1721', 's', '8399', '9625']
[A]:
9967