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]: 4, 8, ['6669', 'G', 'y', '129', 'y', 'x', 'w', 'C', 'J']
[A]: 129


[Q]: 6, 9, ['J', '5177', 'm', '7413', 'T', 'N', '5153', 'S', '8145']
[A]: 13298


[Q]: 6, 19, ['3771', '4665', 'G', 'V', '7843', 'o', 'v', 'm', '8063', 'b', '6603', 'D', 'l', '6907', 'y', 'V', 't', 'x', 'c', 'L', '7475', 'O']
[A]:
21573