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: 2, 16, ['2169', 'o', 'D', '8877', '3351', 'p', 'X', '1143', '9633', 'f', '2507', 'S', '5541', 'B', '4543', 'A', 'f']

Output: 35595


Input: Consider Input: 7, 19, ['8309', 'O', '1491', 'k', '2521', '1161', 'y', '3215', '8345', '1949', '9883', 'g', 'z', 'B', 'S', 'j', 't', '2841', 'j', '3333', 'S', 'w', '2283', '793', 'w', 'q', 'p', 'J', '7979']

Output: 26233


Input: Consider Input: 2, 6, ['861', '407', '8373', 'a', 'j', 'Q', 'l', 'X', 'j', 'c', 'v', '657', '9581', 'L', 'R', '4535', '7423', 't', '6069', '153', '9953', 'p', '8573', 'x', 'd', '9829', '4789']


Output: 8780