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: 2, 19, ['5671', '7557', '3823', '2307', '2763', 'b', 'E', '5081', '4431', '6143', '6939', '9417', '8697', '4175', 'n', '7633', '8723', 'A', '7583', '2081', '7577', '4019', 'q']
Example Output: 85272

Example Input: 4, 6, ['g', '8871', 'q', '597', '8871', '277', 'f', 'e', '2779']
Example Output: 9745

Example Input: 5, 11, ['M', 'w', 'K', '8573', '6911', 'a', '2671', 'i', '7911', 'Z', '2355', '7867', '771']
Example Output:
19848