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, 8, ['r', 'H', 'K', 'K', '7307', 'i', '9381', '4175']
20863

16, 20, ['7527', '5121', 'Q', '4585', '9735', 'Y', 'e', 'p', '755', '8605', 'B', 'O', 'X', '3887', 'M', '8347', '2391', 'v', 'F', '5509', 'e', 'g', 'm', 'j', 'P', 'J']
16247

7, 11, ['8055', '4887', '6397', 'w', 'c', '4363', '7839', '3929', '9417', 'z', '7797', 'I', 'P', 'e', '4099', '5627', '1935', '2413', '2345', '8107', 'I', 'h', 'u']

28982