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: 4, 25, ['H', '501', 'F', '4923', 'C', 'T', 'R', 'b', 'Z', 'e', 'i', 'H', '755', '6503', '2825', 'H', '1995', '7283', '2735', '4433', 's', 'P', '795', 'Z', 'Z']
Example Output: 32247

Example Input: 6, 9, ['J', '5177', 'm', '7413', 'T', 'N', '5153', 'S', '8145']
Example Output: 13298

Example Input: 3, 5, ['2463', '8683', '2591', 's', '6825', 'k']
Example Output:
9416