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.

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

11, 15, ['S', 'F', 'q', 'r', 'X', '2063', '9327', 'R', 'T', 'B', 'j', 'b', 'T', 'X', '3469', 'E', '2177', '8143', 'U', 'Z', '8007', '4991', 'v', 'm', 'f', '7173', 'N', '2449', '2291']
3469

9, 10, ['i', '6901', 'B', 'L', '9501', 'Z', '6993', '529', '2701', '519', '6957', '7467', 'W', 'z', '8431', 'e', '1627']

3220