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: 3, 5, ['7639', '7477', '2545', '6847', 'N', 'H']
Example Output: 9392

Example Input: 6, 9, ['8047', 'Q', 'A', '2811', '8953', 'P', '4515', 'f', 'K', 'u', 'g', 'R', 'p', '667', '8703', '2903', '6299', '417', '3317', 'O', 'z', '3507', '8969', '6193', '2549']
Example Output: 4515

Example Input: 17, 23, ['d', 'u', 'u', 'P', 'D', 'g', 'M', '8893', 'J', '6277', 'h', '4837', 'Z', '4593', 'N', 'X', 'v', '1577', '5827', '2251', 'N', '4243', '2037', 'b']
Example Output:
15935