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.

11, 12, ['S', 'f', 'V', '7983', 'O', 'k', '699', '2831', 'C', 'B', 'B', '1263', 'b', '509', '8963', '8895']
1263

2, 10, ['N', 'K', '4585', 'd', '8219', '3831', 'e', '7037', 'h', 'd', 'c', '577', 'c', '3559', '4059', 'M', '5349', 'V', 'L', '1807']
23672

3, 28, ['u', 'E', '7857', '123', '3735', 'L', '6411', '1055', '851', 'k', 'K', 'd', 'N', '513', '2357', '5691', 'P', 'F', 'f', 't', '6515', 'm', 'v', 'G', 'X', '2715', 'y', 'j']

37823