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, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']
Example Output: 22725

Example Input: 4, 12, ['E', '6343', 'f', '541', '7361', '9993', 'g', '3185', 's', 'w', 'Q', 'I', 'e', 's']
Example Output: 21080

Example Input: 21, 21, ['b', 'B', 'y', 'e', '6799', '2815', '8705', 'd', 'i', 'x', 'o', 'G', 'T', 'S', 'p', 'Q', '1179', '6821', '1839', 'W', 'A', 'Y']
Example Output:
0