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.

Example input: 3, 7, ['A', '23', '7413', '6933', '3369', '807', 'M', '456']
Example output: 18522
Example explanation: Here, the numbers from 3rd to 7th position are '7413', '6933', '3369', and '807', hence their sum (7413+6933+3369+807) is 18522.
Q: 13, 19, ['o', 'f', '4921', 't', '3119', '7049', 'J', '5099', '8031', 'G', 'L', 'Y', '1535', 'g', '3655', 'E', '6599', '2049', '4285', '6851', 'X', '7611', 'C', 'x', '2789', 'H', '215']
A:
18123