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: 24, 27, ['7541', '8415', '3387', 'J', 'U', '1485', 'p', 'c', 'b', 'O', 'm', '4993', '499', '3927', 'e', 'h', 'g', 'x', '5859', 'y', '2543', '1769', '4715', '8359', '9225', '5191', 'T', 'U', 'm', '6157']
Example Output: 22775

Example Input: 1, 10, ['H', 'P', '1985', '1797', '9115', 'V', 'o', '2405', '7817', 't', 'C']
Example Output: 23119

Example Input: 7, 10, ['5907', '8039', '9095', '6827', '8325', '9525', '5499', '4471', 't', '8035']
Example Output:
18005