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: 15, 20, ['o', '7647', 'E', '5963', 'Y', 'B', 'F', 'v', '9553', 'h', 'B', 'L', '8709', '5253', '9337', 'r', '6107', '3099', '8217', '7597', '9571', '5453', '8367']

Output: 34357


Input: Consider Input: 9, 13, ['2813', 's', 'z', 'G', '5927', '4415', 'T', 'c', '7029', 'e', 'o', 'd', '5913', 'y']

Output: 12942


Input: Consider Input: 2, 8, ['L', '9247', '7981', '9165', 'Y', 'v', '1409', 'x', 's', '2679', 'a', '7425', '8677', 'k', 'A', '3595', '2387', 'H', '4911', 'Q']


Output: 27802