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.

17, 22, ['D', '7897', '1603', 'L', '5485', 'S', 'V', '1361', 'a', '9131', 'm', 'V', 'l', 'v', 'Z', '4831', '9561', '1185', 'y', 'D', '1853', '2225', 'j', 'r']
14824

4, 5, ['1427', '7597', '765', 't', '7057', 'f', 'B', 'k']
7057

2, 6, ['1965', '7961', 'e', '7427', '4421', 'a', '2467', '9383', '9117', '6195', 'm', '4299', '803', 'G', '3345', '2657', 'M', 'K']

19809