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.

3, 6, ['7073', '3047', 'O', 'c', 'u', 'G']
0

1, 11, ['R', 'k', '4813', '655', '3185', 'M', '4199', '1857', '9829', '6389', 'X', '3405', 'P', 'x']
30927

10, 11, ['5113', '2803', 'n', 'D', 'T', 'I', '8545', 'C', 'R', 'I', '79', '8115', 'z', '8445', '6179']

79