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, 10, ['9653', '3845', 'm', 'K', 'j', '5041', 'W', 's', 'j', 'A', 'G']
[A]: 8886


[Q]: 16, 16, ['V', '9929', 'S', 'g', '1751', 'd', 'G', 't', '9289', '6139', 'J', 'T', 'W', '8085', '7747', 'j', '5657', '8875']
[A]: 0


[Q]: 15, 23, ['9419', '8299', 'Y', '1955', '4273', 'w', '6635', '2289', 'J', '5723', 'o', 'o', 'Z', 'k', '9891', '2103', '2771', '945', '5583', '8205', '6715', 'z', '2457', '2267', 'N', '2777', '4475']
[A]:
38670