import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int [] v = new int [N];
        int [] w = new int [N];
        int W = 0;
        for(int i=0; i<N; i++){
            v[i] = sc.nextInt();
            w[i] = sc.nextInt();
            W+=w[i];
        }
        int V = sc.nextInt();
        solve(N,v,w,W,V);
    }
    static void solve(int N, int[]v, int[]w, int W, int V){
        int [] sum = new int [W+1];
        boolean [] boo = new boolean [W+1];
        boo[0] = true;
        for(int i=0; i<N; i++){
            for(int j=W; j>=0; j--){
                if(boo[j]){
                    boo[j+w[i]] = true;
                    sum[j+w[i]] = Math.max(sum[j+w[i]],sum[j]+v[i]);
                }
            }
        }
        for(int a=0; a<=W; a++){
            for(int b=a+1; b<=W; b++){
                if(sum[a]<=sum[b]){
                    break;
                }else{
                    sum[b]=sum[a];
                }
            }
        }
        seachMin(sum,V);
        seachMax(sum,V);
    }
    static void seachMin(int[]sum, int V){
        for(int i=1; i<=sum.length; i++){
            if(sum[i]==V){
                System.out.println(i);
                break;
            }
        }
    }
    static void seachMax(int[]sum, int V){
        if(sum[sum.length-1]==V){
            System.out.println("inf");
            System.exit(0);
        }
        for(int i=sum.length-2; i>=0; i--){
            if(sum[i]==V){
                System.out.println(i);
                break;
            }
        }
    }
}