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: 20, 21, ['3975', '2459', 'X', '337', 'X', '5453', '9019', 'O', '4911', '1019', 'y', 'D', 'K', 'W', 'v', '2479', 'a', 'o', '4867', '9195', '3269']
Example Output: 12464

Example Input: 13, 14, ['6693', 'J', '2765', 'P', 'h', '755', 'z', '7483', 'W', '6895', '1293', '3479', 'Y', '1667', '9635']
Example Output: 1667

Example Input: 7, 25, ['8469', 'P', '6535', 'I', 'f', '7343', 'd', 'w', '8103', 'Y', 'S', 'R', 'p', 'b', 'N', '8435', 's', '5657', 'c', 'n', 'o', 't', 'U', '9799', 'e', '9429', '2185', '509']
Example Output:
31994