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.
21, 28, ['9763', '1255', '1213', 'S', 'g', 'Z', '2581', '6849', 'o', 't', 'F', 'E', 'Z', 'C', 'e', 'J', 'd', 'b', '9191', 'i', '7257', 'B', 'K', '1509', '7601', 'L', '1933', '7439']