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]: 3, 5, ['b', 'a', 't', 'l', '8337', 'L', '913', 'O', '1009', '3615', 'u', 'E', 'Y', 'h', '51', '1673']
[A]: 8337


[Q]: 2, 5, ['W', 'A', 'm', 'w', 'r', '9705', '1729', 'U', '2171', 'Q', 'Y', 'P', 'O']
[A]: 0


[Q]: 1, 2, ['H', '8767']
[A]:
8767