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, 6, ['I', '8721', '6901', '737', '5767', '9771', 'h']
Example Output: 9771

Example Input: 3, 4, ['6203', 'g', '471', 'j', 'o', '9679', 'M', '5459', 'y', '1929', '1649', 'C']
Example Output: 471

Example Input: 9, 14, ['421', '5377', 'v', '147', 'l', '1437', '1355', '5947', 'Y', '1247', 'P', 'a', '6433', 'e', 'X', 'V', '4429', 'Y', 'l', 'j', '2507', 'H', 'u', 'y', '7795', '4385', 'w', 'T']
Example Output:
7680