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:
9, 15, ['9375', '9663', 'i', '9607', '4257', '9757', 'r', '937', 'm', 's', '9193', '2269', '4627', '2051', '7045']

Ex Output:
25185


Ex Input:
1, 7, ['2085', '5455', 'l', 't', 'D', 'X', '523']

Ex Output:
8063


Ex Input:
9, 23, ['w', 'v', '2727', 'q', '6543', '6661', 'I', '5693', '2273', '6439', '3643', '963', 'o', '2109', 'V', '9167', 'A', 'g', 'g', '7233', '2339', '1857', 'a', 'O', '6951']

Ex Output:

36023