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, ['5529', 'd', 'W', 'b', 'I', '65', '9995', '6331', '9373', 'V', '8389', 'E', '7455', '105', 'W', 'r', '7733', '7607', 'L', '5553', 'e']
22900

2, 4, ['L', '8053', '8121', 'J', 'H', '7591', 'U', 'm']
16174

6, 20, ['9783', '7267', '5023', '2567', '9713', 'x', '611', '3529', '4217', 'e', '2767', '2001', 'C', 'm', '7307', 'Q', '3215', 'F', 'g', '9989', '4617', '6207', '3861', 'c', '5951', '9315']

33636