{"raw_statement":[{"iden":"problem statement","content":"Takahashi has $N$ kinds of coins; specifically, for $1\\leq i\\leq N$, he has $B_i$ coins worth $A_i$ yen (the currency in Japan) each.\nDetermine if Takahashi can pay exactly $X$ yen (without change) with the coins he currently has."},{"iden":"constraints","content":"*   $1\\leq N\\leq 50$\n*   $1\\leq X\\leq 10^4$\n*   $1\\leq A_i\\leq 100$\n*   $1\\leq B_i\\leq 50$\n*   $A_i$ are pairwise distinct.\n*   All values in the input are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $X$\n$A_1$ $B_1$\n$A_2$ $B_2$\n$\\vdots$\n$A_N$ $B_N$"},{"iden":"sample input 1","content":"2 19\n2 3\n5 6"},{"iden":"sample output 1","content":"Yes\n\nTakahashi has three $2$\\-yen coins and six $5$\\-yen coins. He can use two $2$\\-yen coins and three $5$\\-yen coins to pay exactly $2\\times 2+5\\times 3=19$ yen. Thus, `Yes` should be printed."},{"iden":"sample input 2","content":"2 18\n2 3\n5 6"},{"iden":"sample output 2","content":"No\n\nThere is no combination of the coins that he can use to pay exactly $18$ yen. Thus, `No` should be printed."},{"iden":"sample input 3","content":"3 1001\n1 1\n2 1\n100 10"},{"iden":"sample output 3","content":"Yes\n\nHe need not use all kinds of coins."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}