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.

[Q]: 7, 19, ['6719', 'c', 'S', '3259', '1287', 'u', '9251', '2183', '4821', '9449', 'I', 'P', 'i', '7597', '8141', 'G', 'j', '8587', '7245', 'G', 'O', 'o', '9479']
[A]: 57274


[Q]: 2, 8, ['743', '3417', '5979', 'J', 'f', '4707', 'k', 'i', '2167', 'V', 'g']
[A]: 14103


[Q]: 11, 17, ['3187', 'S', '3721', '1955', 'W', '8037', '4145', 'T', '5667', '3945', '357', '121', 'm', '3653', 'B', '7739', '2895', '6873', '7413', '7083', '8973', 'k', '7249', 'K', '9585']
[A]:
14765