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:
10, 12, ['465', 'V', '3045', 'M', 'Z', '4053', '9621', '6909', '3161', 'M', '6675', '2313', 'v', 'g', 'a', 'x', '9347', 'd', 'x', '4309', '7231', '9745', 'F', '8863', '4667', '2089', 'x']

Ex Output:
8988


Ex Input:
12, 16, ['J', 'B', '4463', 'b', 'o', '5495', 'S', '7657', 'Y', '4805', 'h', 'f', '9743', 'A', '1167', 'W', 'y', 's', '529', '2899', 't', '5111', '3615', '217', '799', '2761', 'V', '3491', '7621', 'R']

Ex Output:
10910


Ex Input:
1, 4, ['d', 'x', 'b', '6217', '6667', 'i', 'H', '1177', 'w', '3049']

Ex Output:

6217