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:
9, 12, ['6001', '6723', '1813', 'S', '3331', 'T', '297', '8105', '7529', 'f', '1459', '323', '8077', 'N', 'W', 'G', 's', 'z', '7559', 't', 'F', 'h', '3771', '975']

Ex Output:
9311


Ex Input:
6, 13, ['5739', '2541', 'p', '4501', 'o', 'k', 'p', 'i', '4611', 'z', 'm', 'q', 'P', '1345', '6751', '7789', 'j', 'e', 'S', '757', 'L', 'M', '3833', 'w', '9621', '2207', 'u', '2765']

Ex Output:

4611