Definition: 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.
Input: 8, 29, ['S', '1801', '621', 'm', '3979', '1269', 'y', '1309', 'R', 'O', '2443', '4681', '8915', '5611', '6293', '6365', '3805', 'J', 'd', '9281', '9461', '2613', 'V', 't', '2507', 'y', 'x', '2717', '3399']

69400