#include <bits/stdc++.h>
#define endl '\n'
#define ll long long

using namespace std;

const int N = (int)110;
int n, W, w[N], v[N], dp[N][N*1000];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	
	cin >> n >> W; int sum = 0;
	for (int i = 1;i <= n;i++)
		cin >> w[i] >> v[i], sum += v[i];
	// dp[i][j]: 前 i 个数凑成 j 的最小重量
	memset(dp,0x3f3f3f3f,sizeof(dp));
	
//	cout << "sum = " << sum << endl;
	for (int j = 1;j <= sum;j++)
		dp[0][j] = 0;
	for (int i = 1;i <= n;i++)
		for (int j = sum;j >= v[i];j--)
				dp[i][j] = min(dp[i-1][j], dp[i-1][j-v[i]] + w[i]);
	int ans = 0;
	for (int j = 0;j <= sum;j++)
		if (dp[n][j] <= W)
			ans = j;
	cout << ans << endl;
		
	return 0;
}