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, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']
10497

8, 26, ['n', '9063', 'c', 'k', '7515', 'm', '2261', '4297', '9817', '7599', '1669', 'l', '9837', '3021', 'Q', '3991', 'r', 'B', '8615', 'J', '5641', '7637', '469', '3571', '2265', '3969']
72398

11, 28, ['E', 'd', 'n', '3257', '6091', '8797', 'R', '7331', '4017', '139', 'P', '169', 't', '4895', '4121', 'I', 'F', 'S', '3779', '2299', 'j', 'J', 'L', 'N', '2187', '1329', '847', '5595', 'g']

25221