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:
11, 12, ['2735', '2057', '8217', '7745', 'p', '165', 'e', 'g', 'c', '2391', '523', 'R', '1009']

Ex Output:
523


Ex Input:
3, 13, ['9585', '4573', '8113', '4163', 'D', '4641', '2077', 'D', '5339', 'Y', 'Z', '9133', '9401', 'o', '5033', 'd', '1745', '1357', '5513', '5369', 'N', '9355', 'C', 'W', 'C']

Ex Output:
42867


Ex Input:
5, 17, ['9149', '8399', 'J', '7437', '7119', 'K', 'm', 'I', 'C', 'z', 'h', '6865', 'l', '8117', 'm', 'U', '6717', 'M', 'g', '7417', 'T']

Ex Output:

28818