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, 9, ['F', '7137', '6127', 'q', '6637', '1423', 'w', '4175', '8971', '3999', '193']
[A]: 34470


[Q]: 4, 4, ['t', 'Z', '8689', 'I', '5589', 'H', 'Z']
[A]: 0


[Q]: 6, 14, ['j', '7827', 'd', '49', 'd', 'f', 'k', '1881', '4727', '873', '3825', 'X', 'G', '8181', '3897', 'C', 'y', '109', '8513', '1345']
[A]:
19487