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.

4, 8, ['3573', '9813', '3867', 'i', '5291', '1987', '9811', 'A']
17089

22, 25, ['875', 'x', '229', 'c', '6921', '2739', '8299', '2043', '9471', 'N', '8051', 'K', 'k', 'l', '7453', '8873', '5807', 'p', 'U', 'G', 'R', 'w', '4367', '3631', 'j', 'G', '7537', 'l', 'D', 'q']
7998

3, 9, ['m', 'O', '3001', 'K', 'd', '4107', '9631', '5369', '497', 'G', 'I', 'd', '2681', 's', '7271', 'L', '9165', '8717']

22605