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: 6, 18, ['5051', 'g', 'C', 'p', 'O', 'i', 'E', '4947', '5345', '8453', '4967', '3749', 'F', 'P', '5045', 'o', '5605', 'H', '9319', '5471', 'F', 'B', 't', 'H']
Example Output: 38111

Example Input: 3, 6, ['x', '7739', '1923', '5829', '2215', 'M', '1901', 'A', '1585', 'W', '2433', '8947', '2217', '7879', 'i', '8543', '7457']
Example Output: 9967

Example Input: 1, 2, ['8221', '209', 'b', 'c', '7519', 'S', 'X', 'w', 'o', '6005', '9093', 'X', 'T', '4109', '7951', 'M', 'R', '995', 'm', '9051', '1563', 'b', 'O']
Example Output:
8430