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.

1, 6, ['u', 'L', 'm', '9283', 'e', '4615', '7815', '7185', 'h', 'h', '8985', '3987', '1521', 'k', '5715', 'd', 'w', 'T']
13898

4, 5, ['b', 'u', '5279', '6945', '6631']
13576

6, 10, ['1193', 's', '8399', '4101', 'e', 'd', 'v', '4423', 'p', 'T', '3595']

4423