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.

5, 11, ['5641', 'c', 'z', '5969', 'w', '9149', 'r', 'B', 'y', '3315', 'M', '8087', 'j', '1159', '9365', 'b', 'a', 'y', '6957', '5735', '9739', '133', 'm', '4887']
12464

10, 12, ['h', 'C', 'q', '7869', 'S', '2545', '3607', '8257', '165', '6373', 'X', '2481', 'a', '5803', '9191', 'v', 'c', 'k', '8077']
8854

9, 12, ['9581', '5897', '7349', 'G', 'X', '7785', 'S', 'T', '5681', 'Z', '4587', '7891', '735', '4277', 'u', 'U', 'p', 'h', 'E', 'v', '469', '2101', '2679', 'E', '1753']

18159