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:
2, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']

Ex Output:
22725


Ex Input:
15, 21, ['w', 'R', '9247', '5745', '5397', 'U', 'R', 'e', '8067', 'e', '2851', 'O', 'F', '4705', '5393', 'q', 'b', 'J', '211', '4319', 'o', 'h', 'Z', '4423', 'j', '2691', 'U']

Ex Output:
9923


Ex Input:
4, 11, ['Z', 'w', '9479', '4035', 'd', 'a', 'z', '2321', 'L', 'Y', '5369', 'd', '3649']

Ex Output:

11725