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.

20, 26, ['8183', 'I', 'o', 'B', '7567', '4953', '8133', '2883', 'g', 'D', '865', 'a', 'y', 'Z', 'F', '3211', 'e', 'X', '5135', '7257', 'G', '1577', '7977', 'X', 'z', 'e']
16811

1, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']
4866

18, 21, ['o', '975', 'X', '3017', '5899', '5587', '2809', '2845', '8847', '3561', 'x', '3071', '669', '3145', 'z', 'r', '8687', '371', '7357', 'f', 'M', '9297', 'm']

7728