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.

1, 8, ['D', '1285', '5209', '1711', '9729', 'C', '2863', '9595', 'F', 'f', '8515', 'g', 'e', '2363']
30392

2, 12, ['2873', '259', 'b', '2009', 'T', '6161', '8637', 'V', 'Z', 'Z', 'q', '6935', '5311']
24001

5, 5, ['8131', '8523', 'b', 'H', '9653', '4887', '685', 'p', 'C', 'u', '3233', 'M', 'z']

9653