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, 28, ['E', 'd', 'n', '3257', '6091', '8797', 'R', '7331', '4017', '139', 'P', '169', 't', '4895', '4121', 'I', 'F', 'S', '3779', '2299', 'j', 'J', 'L', 'N', '2187', '1329', '847', '5595', 'g']
A:
25221