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.

Input: Consider Input: 12, 18, ['9047', '1191', '7027', 'b', '1877', 'n', '337', 'n', 'o', '9007', 'd', 'F', '4929', '2707', 'B', 'y', 'o', '2859', '1609', 'N', 'w', 'H']

Output: 10495


Input: Consider Input: 2, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']

Output: 1351


Input: Consider Input: 4, 7, ['7271', 'B', '1465', '5633', '9135', '6657', '8185', 'j', '3845', 'z', 'N', '6533', '6055', 's', '2175', '3893', 'k', 'L', '1423', '4739', 'w', 'y', '9113', '2705', 's', 'Z', '3709', '8155', 'q', 'A']


Output: 29610