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, 4, ['2879', '5161', 'v', 'c', 'P', 'T', 'p', '6905', 'F']
Example Output: 0

Example Input: 3, 5, ['u', 'Y', '4165', '1421', '7617']
Example Output: 13203

Example Input: 2, 14, ['4149', '9003', 'p', '8207', 's', '7097', 'E', 'W', '1195', '9447', '1865', 'J', 'G', '8701', '4349', 'Q', '4921', 'u', 'i', 'T', '1711', '863', 'n', 'P', 'H', 'P', 'Z', '6857', 'E', 'h']
Example Output:
45515