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:
1, 4, ['2025', '6689', '1227', '3943', 'z', '719', '8941', 'b', 'V', 'w', '5267', '2403', 'N', '5771']

Ex Output:
13884


Ex Input:
2, 7, ['7349', 'P', 'i', 'I', 'e', 'f', '9829']

Ex Output:
9829


Ex Input:
15, 22, ['8387', 'U', '9353', 'n', 'c', '2713', 'm', '2819', '4503', '9587', '6843', 't', '4095', '305', 'v', 'i', '889', '7231', '1629', '6747', 'k', 'a', 'G', '6833', 'l', '1445', 'e']

Ex Output:

16496