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: 5, 9, ['X', '6543', '1123', '5967', 'x', '9197', '2865', 'r', 'V', 'c']

A: 12062
****
Q: 8, 9, ['1329', '3107', 's', 'z', '2013', '1633', 'i', '1229', '4201', 'M', '3127']

A: 5430
****
Q: 1, 22, ['G', 'H', '3715', 'N', '7987', '4389', 'm', 'o', '3313', '29', '8593', 'F', '131', 'T', 'c', '8455', '3533', 'I', '5891', 'k', '9655', '9877', '9915', 'a', 'p', 'z']

A:
65568
****