Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the supplied list has a weight W_i (1 ≤ W_i ≤ 400), a 'desirability' factor D_i (1 ≤ D_i ≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more than M (1 ≤ M ≤ 12,880).

Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.

 #include <iostream>

 #include <algorithm>

 #include <stdio.h>

 using namespace std;

 int w[],d[],dp[];

 int main()

 {

     int n,m;

     while(scanf("%d%d",&n,&m)!=EOF)

     {

         for(int i=;i<=n;i++)

             scanf("%d%d",&w[i],&d[i]);

         for(int i=;i<=n;i++)

         {

             for(int j=m;j>=w[i];j--)

             {

                 dp[j]=max(dp[j],dp[j-w[i]]+d[i]);

             }

         }

         printf("%d\n",dp[m]);

     }

     return ;

 }