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.

Q: 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']

A: 7267
****
Q: 1, 2, ['4319', '3495']

A: 7814
****
Q: 4, 8, ['3915', '4345', '4913', '1091', '4107', 'A', 'R', 'A', '871', '5133', '6641', 'a', 'I', '3919', '8963', 'K', '3417']

A:
5198
****