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.

5, 12, ['2653', 'A', '4739', '149', 'J', '817', 'n', '9589', '965', '1545', 'r', '9061', '7973', '5769', 'Y', '5889', 'A', 'P', '5789', '9757']
21977

16, 18, ['o', '3669', 'M', 'M', 'R', 'r', 'o', 'P', 'q', '9939', '1807', 'F', 'J', 'a', '7773', 'I', 'A', '475', 'W', 'E', '417']
475

10, 20, ['Z', '8141', '9923', 'X', '1689', '561', '5279', '8905', 'b', '6449', '2043', 'm', '1217', '857', '2335', '925', '4745', 'g', 'X', 'J', 'm', 'j', 'V', '5191', '6257']

18571