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.

1, 9, ['6869', '4103', 'S', 'k', '6745', 'n', 'x', '7657', 'F', 'd', '1953']
25374

2, 8, ['6901', '3901', '5101', '4297', '1099', 'q', 'z', '6615', 'z', '6859']
21013

1, 5, ['5401', '6153', '3839', 'q', '2755', 'c', '6003']

18148