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: 2, 6, ['m', 'q', '4069', '4487', 'c', '4639']

Output: 13195


Input: Consider Input: 9, 9, ['2873', '5707', '8689', '7203', '5919', 'C', '7563', '9719', 'k', '217', 'A', '6225', 'b', 'u', '5099', 'A']


Output: 0