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.

3, 26, ['5141', 'c', 'c', 'K', '3639', '4487', 'G', '8839', 'F', '6699', '9171', '9409', 'm', 'N', 'E', '6055', '6819', 'c', 'r', 'u', '2475', 'q', 'F', '319', 'g', '2923', 'o', '6315', '8335']
60835

11, 14, ['H', '4643', 'k', '9583', 'K', '3497', 'Q', '8111', '1837', 'Z', '6885', 'L', '1759', '7777', '3137']
16421

13, 27, ['B', 'x', '4981', '2503', 'D', 'J', 'i', 'U', 'A', '8609', 'L', '4877', 'u', 'n', 'b', 'y', '4925', 'm', 'u', 'B', '9339', '7331', '6253', 'g', 'Q', '9509', '125', '859']

37482