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, 25, ['B', '9955', 'q', '5921', 's', '649', '3867', '9215', '2787', 'S', 'p', '2347', 'h', 'J', '4599', 'z', 'T', 'a', 'M', '883', '9733', '8769', 'l', '1077', '4809', '9231', '6509', 'L', '8633', 'k']
24388