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:
4, 14, ['99', 'F', '1297', '7085', 'u', 'w', 'w', '3803', 'F', 'D', 'F', 'L', '5967', '3545', 'E']

Ex Output:
20400


Ex Input:
5, 21, ['f', 'c', 'y', '1711', '3261', 'I', '3249', 'O', '7875', 'm', '7665', '375', 'V', '4561', 'v', 'J', '2809', '2081', 'i', 'v', 'S', 'f', '8393', 'P', 'r', '4103', 'q', '1141', '9971', '671']

Ex Output:
31876


Ex Input:
17, 18, ['5889', '3243', 'k', 'K', '1167', 'Q', '5159', 'T', 'N', 'w', '3379', 'L', '1507', 'H', '7513', '2525', '7821', '3313', '6303', '5823', 'm', 'l', 'j', 'O']

Ex Output:

11134


