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: 1, 4, ['o', 'O', '7355', 'S', '2513', 'f', '4189']
Example Output: 7355

Example Input: 16, 17, ['Z', '8799', 'Z', 'P', '3413', 'X', '939', 's', 'G', 'x', '6911', 'v', '1183', '3507', 'r', 'C', 'k', 'Z', '4247']
Example Output: 0

Example Input: 3, 21, ['3849', 'C', '7257', 's', 'A', '6253', 'd', '3813', 'i', 'B', '4227', '2071', '2595', '7317', '5647', '9563', '6975', 'b', 'h', '1653', '2371']
Example Output:
59742