import java.util.Arrays;
import java.util.Scanner;
/*
*揹包九講之一:01揹包問題
*/
public class bishi {
//滾動數組實現,也就是最簡單的那種
public static void backbag(int n,int v,int[] c,int[] w)
{
/* int[] a = new int[v+1];
for(int i = 0;i<n;i++)
{
for(int j = v;j>=0;j--)
{
if(j-c[i]>=0&&a[j]<a[j-c[i]] + w[i])
{
a[j] = a[j-c[i]] + w[i];
}
}
}
System.out.println(a[v]);*/
/**/ int[][] a = new int[n][v+1];
for(int i = 0;i<n;i++)
for(int j = 0;j<v+1;j++)
{
if(0 == i)
{
a[i][j] = w[i];
}
else if(j>=c[i]&&a[i-1][j]<a[i-1][j-c[i]]+w[i])
{
a[i][j] = a[i-1][j-c[i]]+w[i];
}
else
{
a[i][j] = a[i-1][j];
}
}
System.out.println(a[n-1][v]);
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int v = sc.nextInt();
int[] c = new int[n];//每一個物品佔用體積
int[] w = new int[n];//每一個物品的價值
for(int i = 0;i<n;i++)
{
//依次輸入一個物品的體積價值
c[i] = sc.nextInt();
w[i] = sc.nextInt();
}
backbag(n,v,c,w);/**/
}
}
5 20 3 4 4 5 1 2 4 3 5 6
20