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: 5, 7, ['t', 'e', 'P', 'H', 'I', 'U', 'a', '8147', 'i', 'D', 'x', 'x', 'i', 'm', '4893', '6443', '8841', 't', '4641', '9415', '1965', '673']

Output: 0


Input: Consider Input: 8, 22, ['h', '2971', 'l', 'F', 'e', 'f', 'b', 'I', 'b', '4759', 'm', 'w', '6179', 'R', '2875', '3469', '3801', 'm', '6987', 'A', 'c', '6303', '8135', 'c']

Output: 34373


Input: Consider Input: 14, 27, ['k', 'N', '2945', 'e', '9815', 'i', 'i', 'c', 's', '8813', 'y', '95', 'q', '5783', '869', '599', '5343', '9073', '8119', 'y', 'v', 'L', '5029', '6595', 'i', 'W', 'w']


Output: 41410