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.

Ex 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']

Ex Output:
0


Ex Input:
8, 9, ['3587', '5903', 'B', '9671', 's', 'A', '7259', '6961', '2601', '9719']

Ex Output:
9562


Ex Input:
5, 7, ['Z', 'N', 'W', 'M', '2139', '607', '6519', '5927', '2657', 'G', 'x', '591', 'g']

Ex Output:

9265