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, ['u', 'Y', '4165', '1421', '7617']
[A]: 13203


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


[Q]: 1, 9, ['H', '2391', 'Q', '8651', 'u', 'j', 'L', 'L', 'L', 'z', '3009']
[A]:
11042