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: 2, 10, ['1711', '201', '6463', 'J', 'z', 'D', 'I', 's', '2161', 'I', '2479', '4475', '2519', '7511']
Example Output: 8825

Example Input: 13, 14, ['Y', '423', '3853', '599', '1721', '5325', '9693', 'X', 'P', 'm', '9693', 'N', 'S', '6925', '6569', 'X']
Example Output:
6925