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.

2, 10, ['N', 'K', '4585', 'd', '8219', '3831', 'e', '7037', 'h', 'd', 'c', '577', 'c', '3559', '4059', 'M', '5349', 'V', 'L', '1807']
23672

2, 9, ['i', 'C', '833', '1739', 'M', '2417', '5807', '2287', '9765', '3661', '9095', 'j', '1943', '2905', 'F', 'C', '4941', '117', 'G', 'j', '8567', 'I']
22848

6, 7, ['7007', '2573', '6549', 'l', 't', 'E', '6579', '5837', '9163', '2753', '6669']

6579