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: 11, 20, ['8031', 'v', 'p', '4015', 'v', '3299', '4143', '445', 'I', 'L', 'm', 'u', '7963', '8085', 'c', 'k', 'I', 'A', '8433', '1897', 'g', 'x', '5935', '5195', 'W', 'j', 'A']

A: 26378
****
Q: 5, 6, ['M', '4965', '7693', 'g', 'G', '695', '2401', '5715', 'P', '8197']

A: 695
****
Q: 4, 17, ['Q', 'm', 'j', '205', '5321', 'C', '1939', 'B', 'h', '4455', '5431', '6371', '2077', 'f', '337', '7593', '1693', '7419', '7109']

A:
35422
****