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.

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']
26378

2, 2, ['R', '979', 'H', 'W', 'y']
979

6, 8, ['9749', '1257', '3153', '2387', 'T', 'j', '8483', '8849', '5575', '2925']

17332