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, 5, ['W', 'A', 'm', 'w', 'r', '9705', '1729', 'U', '2171', 'Q', 'Y', 'P', 'O']

Ex Output:
0


Ex Input:
1, 14, ['J', '4147', 'z', 'M', 'Z', 'd', 'f', 's', '5083', 'L', '7107', 'g', '7047', 'E', '5931', '141', '6889']

Ex Output:
23384


Ex Input:
6, 12, ['N', '8957', '1811', 'r', 'l', '1243', '8245', '6119', '2135', 'M', 'R', 'b', 'M', '8189', 'I', 'O', 't', '8367', 'C', 'D', '9977', '4687', 'b', 'Y', 'L', 'b', 'U', 'i', '839', '2069']

Ex Output:

17742