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: 6, 15, ['H', 'u', 'Y', 'Z', 'm', '1897', 'u', '2511', '507', '4977', '2019', '8913', 'Q', '5835', '1787', 'q', '1197']

Output: 28446


Input: Consider Input: 2, 4, ['L', '8053', '8121', 'J', 'H', '7591', 'U', 'm']

Output: 16174


Input: Consider Input: 3, 17, ['L', 'x', '4469', '119', 'n', 'K', '2501', 'U', 'X', '6385', '971', '5317', 'e', 'w', 'l', '2949', 'd', 'S', 'd', 'X', 'Z', 'G', '5285', 'u', '4907', '8205', 'F']


Output: 22711