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: 3, 10, ['7377', 'j', '9565', '6661', '1941', 'F', '1139', 'R', 'H', '9521', '8933', '8077', '6019', 'b', 'j', '6423', 'a', '1741', '621', 'i', '2409', 'e', 'a', '7827', '5539', 'm', '401', '629', '8439']

28827