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, 3, ['o', 'p', '4765', 'u', '629', 'p']
4765

2, 2, ['8023', '9385', '7533', 'd', 'H', '3751', 'A', '1399']
9385

1, 7, ['U', 'k', '5403', '6655', '7185', '8343', '8911', 'P', '2751', '67', 'R']

36497