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: 5, 15, ['r', '6933', '8849', '3479', 'H', '4269', '7469', '9359', 'K', '3371', 'A', '5371', 'z', 'K', '6147', 'i', 'Q', '9055', 'b', 'g', 'x', '5357', 'L', '2797', '7683', 'L', '7127', 'M']

Output: 35986


Input: Consider Input: 2, 10, ['143', '3769', '197', '3281', '1839', '8009', 'J', '1019', 'Z', 'y', 'M', 'w', '827', '3603', 'r', '6401', '1039']

Output: 18114


Input: Consider Input: 5, 27, ['Y', '315', '3539', 'j', 'N', 'X', 'e', 'I', '2289', 's', 'Z', '1315', '2249', 'O', 'U', 'd', 'U', 'k', 'z', 'J', 'e', 'R', '877', 'D', 'W', '2387', '4905', '3283', '5241']


Output: 14022