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.

20, 21, ['3975', '2459', 'X', '337', 'X', '5453', '9019', 'O', '4911', '1019', 'y', 'D', 'K', 'W', 'v', '2479', 'a', 'o', '4867', '9195', '3269']
12464

3, 4, ['v', 't', '4357', '1303']
5660

16, 20, ['4545', '625', 'E', '2691', 'W', '4871', '1939', '7239', 'K', 'l', '5607', '1433', 'L', '1875', '535', 'j', '9825', 'B', '6361', '3893', 's', 'y', '1429', '4519', 'E', 'w', '1485']

20079