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.
13, 19, ['G', '4115', '9015', 'T', 'r', '5489', '8455', 'w', 'h', '6319', '7279', '7553', 'j', 'R', '1811', 'a', 'M', '1065', 'h', '8877', 'E', '307', 'm', '4957', '2353']