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, 5, ['4311', 'E', 'q', '123', 'K', 'N', '7531', 'x', 'h', 'H', '9919', '705', '3025']
123

4, 11, ['4679', 'V', '3421', '8995', '2885', '5395', 'E', '2169', 'i', 'B', '9279', 'G', 'N', 'I', 's', '6827', 'S']
28723

13, 18, ['q', '5369', 'Y', 'G', '4967', '1575', 'Q', 'H', 't', '2627', '2223', 'z', 'V', '5625', 'b', '1715', 'A', '2651', 'X', '2997', '1805', '8695', 'K', 'E', 'Z', '9231', 'x']

9991