import java.util.HashMap;
import java.util.Scanner;

public class Explorer {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int N = scanner.nextInt();
        int M = scanner.nextInt();
        int T = scanner.nextInt();

        int[] A = new int[N - 1];
        for (int i = 0; i < N - 1; i++) {
            A[i] = scanner.nextInt();
        }

        HashMap<Integer, Integer> rewards = new HashMap<>();
        for (int i = 0; i < M; i++) {
            int Xi = scanner.nextInt();
            int Yi = scanner.nextInt();
            rewards.put(Xi, Yi);
        }

        boolean canReach = canReachLastRoom(N, T, A, rewards);
        if (canReach) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }

    private static boolean canReachLastRoom(
        int N, int timeLimit, int[] travelTimes, HashMap<Integer, Integer> rewardRooms) {
        int currentTime = timeLimit;

        for (int i = 0; i < N - 1; i++) {
            // Move to the next room
            currentTime -= travelTimes[i];

            // Check if there is a reward in the current room
            if (rewardRooms.containsKey(i + 2)) {
                currentTime += rewardRooms.get(i + 2);
            }

            // If the remaining time is not enough to reach the next room, return false
            if (currentTime <= 0) {
                return false;
            }
        }

        return true;
    }
}

A TimeLimitExceeded encountered while compiling your code.