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.

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

7, 17, ['149', 'O', 'h', '7873', '9227', '5655', '8945', 'I', 'c', 'V', 'Z', 'I', 'L', '1153', 'L', 'Y', '2031', 'B', 'S', 'x', 'u', '2483', 'M', '2469', '4991']
12129

1, 2, ['O', '867', '3863', 'r', '403', 'c', '3867', '1451', 'y', '2975', 'L', 'r', 'n']

867