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.

Example Input: 1, 11, ['q', 'q', 'P', '4335', 'l', 'k', 'D', 'R', '719', 'g', '855', 'l', '6639', '7935', '8407', 'A', 'H', '8357', '759', 'i', '1205', 'B', 'Q', 'V', '359', '4565', '9975', 'g', 'h', '9585']
Example Output: 5909

Example Input: 2, 9, ['F', '7137', '6127', 'q', '6637', '1423', 'w', '4175', '8971', '3999', '193']
Example Output: 34470

Example Input: 3, 5, ['X', 'M', 'o', '5993', 'J', '8065', '1259', 'n', 'W', '5923', '6985']
Example Output:
5993