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.

9, 13, ['2813', 's', 'z', 'G', '5927', '4415', 'T', 'c', '7029', 'e', 'o', 'd', '5913', 'y']
12942

6, 7, ['1595', '1523', '157', 'I', '3929', '6313', 'H', 'f', 'e', '93', '5625', 'b', 'J', 'b', '1185', '1505', 'I', 'y', '4043']
6313

2, 23, ['Y', '8991', '9169', '6303', '8061', 'e', '4991', 'D', '8133', 'A', '4833', 'w', '3163', '3375', '8847', 'W', '2143', '1821', 'b', '2557', '3251', '325', 'F', 'b', '2407', 'W', 'w']

75963