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:
22, 23, ['H', '5147', '9429', 'v', '7687', 'r', '847', '1305', '483', '5113', '3175', 'N', '6195', 'A', '9111', '7507', '9639', 'W', '6673', 'T', '7525', 'g', 'O', '8593', 'g', '5257']

Ex Output:
0


Ex Input:
2, 16, ['e', 'Q', '4017', '1999', '2413', 'v', '4911', 'N', 'x', '3475', '2179', 'o', 'a', '6361', '1723', '6273']

Ex Output:
33351


Ex Input:
1, 7, ['w', 'M', 'o', 'p', '733', 'm', 'x', 'l', '9607', 'l', 'J', 'z']

Ex Output:

733