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: 1, 1, ['D', 'W', '5783']

Output: 0


Input: Consider Input: 5, 9, ['1523', 'C', 'd', 'I', '6913', '5553', '2769', '767', 'v', '231', 'I', 'p', '9033', 'H', '2007', 'g', '5837', 'Z']

Output: 16002


Input: Consider Input: 8, 10, ['t', 'w', 'Y', '9449', '677', 'X', '6967', 'B', 'Z', 'C', '1681', '1203', '8427', '185', 't', 'm', 'n', '6847', '3247', '8095', '4163', '6355', 'a', 'd', 'M']


Output: 0