import java.io.*;
import java.util.*;

public class Main {
    static Nap[] naps;
    static int[] weights;
    static int[] values;
    static ArrayList<HashMap<Integer, Integer>> dp = new ArrayList<>();
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int totalW = 0;
        int totalV = 0;
        naps = new Nap[n];
        for (int i = 0; i < n; i++) {
            naps[i] = new Nap(sc.nextInt(), sc.nextInt());
            totalV += naps[i].value;
            totalW += naps[i].weight;
            dp.add(new HashMap<>());
        }
        Arrays.sort(naps);
        weights = new int[n];
        values = new int[n];
        weights[0] = naps[0].weight;
        values[0] = naps[0].value;
        for (int i = 1; i < n; i++) {
            weights[i] = weights[i - 1] + naps[i].weight;
            values[i] = values[i - 1] + naps[i].value;
        }
        int v = sc.nextInt();
        int left1 = 0;
        int right1 = totalW;
        while (right1 - left1 > 1) {
            int m = (left1 + right1) / 2;
            if (dfw(n - 1, m) >= v) {
                right1 = m;
            } else {
                left1 = m;
            }
        }
        if (totalV == v) {
            System.out.println(right1);
            System.out.println("inf");
            return;
        }
        int left2 = right1;
        int right2 = totalW;
        while (right2 - left2 > 1) {
            int m = (left2 + right2) / 2;
            if (dfw(n - 1, m) > v) {
                right2 = m;
            } else {
                left2 = m;
            }
        }
        System.out.println(right1);
        System.out.println(left2);
    }
    
    static int dfw(int idx, int w) {
        if (w < 0) {
            return Integer.MIN_VALUE;
        }
        if (idx < 0) {
            return 0;
        }
        if (dp.get(idx).containsKey(w)) {
            return dp.get(idx).get(w);
        }
        if (w >= weights[idx]) {
            return values[idx];
        }
        int ans = Math.max(dfw(idx - 1, w), dfw(idx - 1, w - naps[idx].weight) + naps[idx].value);
        dp.get(idx).put(w, ans);
        return ans;
    }
    
    static class Nap implements Comparable<Nap> {
        int value;
        int weight;
        
        public Nap(int value, int weight) {
            this.value = value;
            this.weight = weight;
        }
        
        public int compareTo(Nap another) {
            return weight - another.weight;
        }
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public String nextLine() throws Exception {
        return br.readLine();
    }
    
    public String next() throws Exception {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}