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:
5, 8, ['j', '1099', 'J', 'l', 'E', '6559', '6181', '4441']

Ex Output:
17181


Ex Input:
10, 12, ['V', 'u', '595', '6877', 'h', '5315', 'a', 'S', 'T', '9793', 'E', '8261', 'H']

Ex Output:

18054