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, 4, ['2977', 'i', 'l', 'r', '8835', '7697', 'p', '1685', 'h', 'N', 'Z', '8661', '6003', '7007', 'D', 'C']

Ex Output:
0


Ex Input:
8, 25, ['y', 'r', '639', '6501', '7755', 'A', 'v', 't', '3209', '7899', 'Z', '6099', 'Q', 'L', 'T', 'b', 'P', '6913', 'J', '8855', '551', '4509', '143', '9331', 'c']

Ex Output:
47509


Ex Input:
20, 27, ['e', 'a', 'G', 'Y', 'j', 'F', '367', '7325', 'G', 'c', 'x', '51', '9259', 'j', 'V', '7409', '1541', 'K', 'T', '171', '3055', '2615', 'm', '7721', '713', '5211', 'q', 'r', 'H']

Ex Output:

19486