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.
13, 16, ['m', 'I', 'V', 'W', 'i', 'n', 'L', 'H', 'w', '6923', 'V', '3133', 'B', 'g', '9451', 'E', '5611', '6151', 'Z', '6331', '3649', '4523', '5209', '513']