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]: 16, 16, ['V', '9929', 'S', 'g', '1751', 'd', 'G', 't', '9289', '6139', 'J', 'T', 'W', '8085', '7747', 'j', '5657', '8875']
[A]: 0


[Q]: 1, 1, ['7479', 'q', 'F', '5725', '7697', '6653', '275', 'l', '7349', 'c']
[A]: 7479


[Q]: 7, 14, ['5771', '5881', 'f', 'E', 'I', 'D', 'B', '7787', 'Y', '4323', 'T', 'Q', 'I', '4695', '6669', 'U', 'o', 'B', '1767', 'U']
[A]:
16805