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, 6, ['x', 't', '9767', '4787', 'T', 'e', 'Y', '8919']

Ex Output:
0


Ex Input:
3, 16, ['1165', 't', '4833', 'b', '6361', '1175', '3943', 'd', 'l', '7519', 'j', 'X', 'E', 'A', 'm', '6469', '9429', '2415', '5187', 'k', 'd', '9607', '1375', '8913', 'c', 'A', '9229']

Ex Output:
30300


Ex Input:
4, 16, ['B', 'u', 'M', 'C', '9069', '815', '2175', '6087', 'o', '115', '9559', '2365', 'Z', 'e', '277', '1889', '6181', '6895', 'm']

Ex Output:

32351