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: 11, 24, ['I', '2857', 'D', '1863', '5591', '8371', '721', '3839', '3071', 'g', '2871', '5955', '7541', '1641', 'u', '4593', '5805', '3589', 'z', '5675', 'e', '4513', '8805', '5467', '1451', '4013', 'J']
A:
56455