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.

Ex Input:
3, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']

Ex Output:
22632


Ex Input:
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']

Ex Output:
57274


Ex Input:
8, 9, ['3761', '7615', '6719', 'K', '3783', '4607', 'C', '6895', '3529', '4443', 'E', '8049', 'C', '8495', '685', '5471']

Ex Output:

10424