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:
3, 19, ['4723', 'r', 'b', 'I', '7639', 'x', 'j', '1697', '8525', '4083', 'i', '1337', 'Q', '3705', '4229', 'L', '3721', 'g', '2569', 'j', '447', '2421', '9513', 'p', '6663']

Ex Output:
37505


Ex Input:
2, 12, ['8519', 'c', '7575', '1517', '2735', '4339', '7765', '6455', 'D', 'G', '2437', '9663', '3765', '299', 'n', '7921', 't', 'M', 'l', '515']

Ex Output:
42486


Ex Input:
1, 4, ['M', '6021', 'd', 'g', '8467', 'z']

Ex Output:

6021