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: 3, 5, ['u', 'Y', '4165', '1421', '7617']

Output: 13203


Input: Consider Input: 2, 4, ['8181', '9349', '2531', 'S', '5333', '3721', '9641']

Output: 11880


Input: Consider Input: 3, 9, ['7039', '6947', '5863', 'g', '8243', '1963', 'W', 'Q', 'S']


Output: 16069