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: 2, 5, ['9153', 'S', '605', '2951', 'I', 'o', '4995', '2895']
Example Output: 3556

Example Input: 3, 6, ['l', 'C', '6183', 'd', '6519', 'm']
Example Output: 12702

Example Input: 1, 7, ['6063', '403', '3341', 'q', 'm', '9247', 'R', '5893', '5693', 'M', 'H', 'v', '6517', '7917', 'E', 's', 'b', '1487', 'c', '4665', '733', '4057', '1839']
Example Output:
19054