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: 7, 15, ['1769', 'c', '7895', '8687', '985', '7559', '1109', 'X', 'z', '2309', 'D', 'P', '8655', 'I', 'u', 'z', '9639', '83', '7631']
Example Output: 12073

Example Input: 4, 13, ['2921', '5905', '2835', '3625', '2481', '1657', '6239', '2393', 'u', '3255', '7061', '8197', 'k', '269', '1135', '5833', '7847', 'C', '4371', '4783', '9613']
Example Output: 34908

Example Input: 12, 14, ['K', 'M', '881', '9687', '1979', 'i', '3643', '9769', 'O', '6405', '2617', 'X', 'b', '9219', 'g', '4511', 'L', '3685', 'r', '6927', 'r', 'v', 'y', 'p']
Example Output:
9219