#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <climits>
#include <stack>
#include <string>
#include <set>
#include <cmath>
#include <map>
#include <unordered_map>
#include <numeric>
#include <random>
#include <memory>
#include <chrono>
#include <iterator>

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define mp make_pair
#define pb push_back
#define sz(x) int((x).size())


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 2e3 + 7;
const int inf = INT_MAX / 3;
const ll INF = LLONG_MAX / 3;
const int MOD = 1e9 + 7;

ll n, H, dp[N][N], sumrost;
struct Pupil {
    ll h, l, id;
} a[N];


signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    cout << fixed << setprecision(9);
    ios::sync_with_stdio(false);
    cin.tie();
    cout.tie();

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].h >> a[i].l;
        a[i].id = i;
        sumrost += a[i].h;
    }
    sort(a + 1, a + n + 1, [](Pupil a, Pupil b) { return a.h + a.l < b.h + b.l; });
    cin >> H;

    for (int i = 0; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            dp[i][j] = -inf;
        }
        dp[i][0] = sumrost;
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            dp[i][j] = dp[i - 1][j];

            if(dp[i - 1][j - 1] + a[i].l >= H && dp[i - 1][j - 1] - a[i].h > dp[i][j]) {
                dp[i][j] = dp[i - 1][j - 1] - a[i].h;
            }
        }
    }

    ll ans = 0;
    for (int j = n; j >= 0LL; j--) {
        if (dp[n][j] > -inf) {
            ans = j;
            break;
        }
    }
    cout << ans << endl;
    int i = n, j = ans;
    while (j) {
        if( dp[i - 1][j - 1] == dp[i][j] + a[i].h) {
            cout << a[i].id << " ";
            i--, j--;
        }
        else {
            i--;
        }
    }

    return 0;
}