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: 8, 11, ['5059', '2111', 'E', '8681', '5859', '7293', '9627', 'L', 'N', 'n', 'i']
Example Output: 0

Example Input: 3, 4, ['6203', 'g', '471', 'j', 'o', '9679', 'M', '5459', 'y', '1929', '1649', 'C']
Example Output: 471

Example Input: 7, 14, ['7933', 'M', '3569', '7199', '8621', '7941', '5753', 'M', 'x', '4049', '7685', 'l', '5239', '2963', '4719', 'Z', 'v', 'z', '2309', '705', '7835', 'r']
Example Output:
25689