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.

12, 17, ['k', '9879', 'R', '2595', 'c', 'p', '3825', 'y', 'i', '6281', '927', 's', '5407', '9137', 'F', '8207', 'L', 'I']
22751

2, 3, ['3335', '3451', 'f', 'M']
3451

6, 14, ['77', '7327', 's', '4423', 'y', 'H', '917', '3741', 'u', 'L', '9481', 'L', 'V', 'o']

14139