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.

Ex Input:
2, 6, ['m', 'q', '4069', '4487', 'c', '4639']

Ex Output:
13195


Ex Input:
4, 10, ['C', '6511', 'S', '5389', '5679', 'O', 'Z', 'm', 'p', '1135', '7887', '6407', '6561']

Ex Output:
12203


Ex Input:
3, 24, ['5575', '8843', 'c', '9121', 'z', 'R', '6771', '9055', '5705', 'w', '9077', 'n', '3643', 'u', 'U', 'A', '6635', 'v', '4077', '3521', 'g', '177', '6027', '7329', '6623', '9927']

Ex Output:

71138