#include <stdio.h>
#include <stdlib.h>

void Solv01Knapsack(int *v,int *w,int n,int W)
{
    /* int **sol_value=(int **)malloc(sizeof(int *)*2);
     int **sol_weight=(int **)malloc(sizeof(int *)*2);

     sol_value[0]=(int *)malloc(sizeof(int)*(W+1));
     sol_weight[0]=(int *)malloc(sizeof(int)*(W+1));

     sol_value[1]=(int *)malloc(sizeof(int)*(W+1));
     sol_weight[1]=(int *)malloc(sizeof(int)*(W+1));

     for(int i=0; i<n; i++)
         for(int j=0; j<=W; j++)
         {
             if(i==0)
             {
                 if(w[i]<=j)
                 {
                     sol_value[(i+1)%2][j]=v[i];
                     sol_weight[(i+1)%2][j]=w[i];
                 }
                 else
                 {
                     sol_value[(i+1)%2][j]=0;
                     sol_weight[(i+1)%2][j]=0;

                 }
                 continue;
             }

             sol_value[(i+1)%2][j]=sol_value[i%2][j];
             sol_weight[(i+1)%2][j]=sol_weight[i%2][j];

             if(w[i]<=j && sol_value[(i+1)%2][j]<=sol_value[i%2][j-w[i]]+v[i])
                 {
                     sol_value[(i+1)%2][j]=sol_value[i%2][j-w[i]]+v[i];
                     sol_weight[(i+1)%2][j]=sol_weight[i%2][j-w[i]]+w[i];
                 }

         }


     printf("%d %d",sol_weight[n%2][W],sol_value[n%2][W]);
     free(sol_value[0]);
     free(sol_weight[0]);
     free(sol_value[1]);
     free(sol_weight[1]);
     free(sol_value);
     free(sol_weight);
     */

    int *Dp=(int *)calloc(W+1,sizeof(int));
    int sol_value=0,sol_weight;

    for(int i=0; i<n; i++)
        for(int j=W-w[i]; j>=0; j--)
            if(Dp[j+w[i]]<Dp[j]+v[i])
            {
                  Dp[j+w[i]]=Dp[j]+v[i];
                  if(Dp[j+w[i]]>=sol_value)
                  {
                      sol_value=Dp[j+w[i]];
                      sol_weight=j+w[i];
                  }
            }

      printf("%d %d",sol_weight,sol_value);
      free(Dp);
}
int main()
{
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);

    int n=0,W=0;

    scanf("%d",&n);
    scanf("%d",&W);

    int *w=(int *)malloc(sizeof(int)*n);
    int *v=(int *)malloc(sizeof(int)*n);

    for(int i=0; i<n; i++)
        scanf("%d %d",&w[i],&v[i]);


    Solv01Knapsack(v,w,n,W);
    free(w);
    free(v);



    return 0;
}