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.

16, 20, ['8615', '8269', 'k', 'R', 'l', '9823', '6879', '7777', 'w', '8443', 'W', '6951', 'Q', '8251', 'M', 'g', 'F', 'w', 'C', '7267', 's', '973', '4703', '8921']
7267

6, 23, ['s', '5425', '7485', 'I', 'r', 'I', '3943', '4067', '3773', '2459', '1525', '2093', '1103', '7373', 'h', 'j', '3209', 'o', 'Q', 'I', '1295', '4569', '4301', 'C', 'N', '269']
39710

2, 16, ['E', 'P', '3293', 'T', 'k', '5123', '6801', '799', '3693', 's', 'l', '203', 'M', '5073', 'M', 't']

24985