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, 8, ['743', '3417', '5979', 'J', 'f', '4707', 'k', 'i', '2167', 'V', 'g']

Ex Output:
14103


Ex Input:
6, 15, ['H', 'u', 'Y', 'Z', 'm', '1897', 'u', '2511', '507', '4977', '2019', '8913', 'Q', '5835', '1787', 'q', '1197']

Ex Output:
28446


Ex Input:
2, 13, ['9787', 't', '3069', '6925', '949', 'C', 'q', 'D', '7547', 'M', 'k', 'O', '2717', 'S', 'w']

Ex Output:

21207