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, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']
[A]: 28546


[Q]: 1, 2, ['9769', 'z', '6349', 't', '9391', '7181', '2405', 'j']
[A]: 9769


[Q]: 2, 6, ['y', '9407', 'T', 'R', '4127', 'a', 'N', '2467', 'N', 'T', '6883', '1695', 'w', 'Q', '2849']
[A]:
13534