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: 14, 17, ['Q', '7681', '8379', '2569', 'D', '5179', 'M', 'M', 'k', '187', '9275', 'V', 'L', 'F', '6397', '6385', 'O', '4823', '8655']

A: 12782
****
Q: 9, 11, ['6655', 'V', 'm', '3229', '2427', '9165', 'F', 'c', 'K', '3925', '1261', '1055', 'S']

A: 5186
****
Q: 2, 11, ['1329', 'i', 'R', '6247', 'v', '5807', '3445', 'V', 'z', '8675', 'a', '9009', 'l', '241', '9419', 'h', '3251', 'j', '7827', '6275', 'b', '9347']

A:
24174
****