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: 12, 20, ['V', 'H', '5509', 'J', '887', '6361', '4273', '1017', '5167', 'G', 'g', '5185', '2617', 'h', 'Y', '7697', '5075', 'F', '2675', '29', 'K', '2081', 'R', '7011']

Output: 23278


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: 19, 25, ['7775', 'C', 'z', '6947', 'U', '3191', 'v', '7389', 'Q', 'b', 'R', 'X', 'y', '2683', '4623', '8101', 'S', 'q', 'R', 'i', 'T', '6077', 'P', '5199', '5803', 'Q', 'w', 'g', 'n']


Output: 17079