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, 2, ['4965', '6219']
6219

22, 25, ['681', '2393', 'f', 'g', '5051', '5839', 'T', 'p', '8057', '6929', 'N', '1519', 'G', '8969', '8589', 'T', 't', '4915', 'r', 'M', 'N', '8285', '8607', '4333', '7457', '343', 'f', 'r']
28682

4, 20, ['K', '2679', 'A', 'D', '7837', '4191', '4319', '7781', '4625', '5581', '5695', '8079', '8555', 'o', 'o', '351', 'X', 'q', 'O', '9665', '3191', 'j', 'A', '5221', '8073', 't', '5411', 'w', '7201', 'c']

66679