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, 6, ['B', 'N', 'b', '9383', '4711', 'K']
14094

3, 4, ['9567', '9317', 'l', 'n', 'i', '6993', '2775', '2651', '1311', '2955', '6271', 'b', '7333', 'U', 'd', '6455', 'n', 'o', '1871', 'u']
0

3, 5, ['4649', '377', 'r', '7209', '2467', 'B', '7057', '2737', 'S', 'd', 'S', 'O', '7419', 'q', '7835', 'B', 'l', 'p', '2245', 'b', '21', 'Z', '3827']

9676