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: 3, 14, ['D', 'Q', 'W', '3925', '7569', '2455', '9499', 'A', '3205', '9459', 't', '9053', 'q', 'T']
Example Output: 45165

Example Input: 4, 6, ['g', '8871', 'q', '597', '8871', '277', 'f', 'e', '2779']
Example Output: 9745

Example Input: 2, 3, ['4563', '8275', 'z', 'd', '2953', '9757', 'G', '4857', 'I', '9419', '1421', '1613', 'N', '3511', '4777', '6023', 'D', '7757']
Example Output:
8275