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: 12, 26, ['B', 'r', 'O', '3195', '3381', '1751', '6271', '7747', 'P', 'Q', '4533', '7307', '5933', 'Q', 'w', 'g', '4481', '3691', 'e', '3351', 'f', '9839', '7243', '6575', '8577', '7811', 's', 's']
A:
64808