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.

3, 4, ['4845', '7313', 'P', 'A', '2285', 'C', 't']
0

1, 11, ['q', 'q', 'P', '4335', 'l', 'k', 'D', 'R', '719', 'g', '855', 'l', '6639', '7935', '8407', 'A', 'H', '8357', '759', 'i', '1205', 'B', 'Q', 'V', '359', '4565', '9975', 'g', 'h', '9585']
5909

5, 9, ['3625', 'X', '7891', '5331', 'I', 's', 'B', '5417', '9505', 'V', 'b', 'H', 'L', '7653', '2669', 'D', '3081', 'T']

14922