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: 16, 16, ['V', '9929', 'S', 'g', '1751', 'd', 'G', 't', '9289', '6139', 'J', 'T', 'W', '8085', '7747', 'j', '5657', '8875']

Output: 0


Input: Consider 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']

Output: 0


Input: Consider Input: 6, 14, ['6985', '5953', '9263', '2455', '933', 'v', '7943', '8889', 'V', '2593', 'f', 'Z', 'Z', '4493', 'F', 'R', 'x', '2581']


Output: 23918