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, 2, ['R', '979', 'H', 'W', 'y']

Ex Output:
979


Ex Input:
3, 6, ['l', 'C', '6183', 'd', '6519', 'm']

Ex Output:
12702


Ex Input:
2, 9, ['O', '883', 'z', '7983', '5307', '3407', '1033', '9167', 'W', '3459', 'z', '3859', 'T', 'y', 'v', 'k', 'b', '1227', 'w', '9803', '3369', '2631', '1575', 'Y', 'h', '9799', 'P', '3177']

Ex Output:

27780