/*input
4 6
3 9
3 9
3 9
6 18
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define int long long
#define N 1005
#define bit(x,y) ((x>>y)&1LL)
#define show(x) cout << (#x) << ": " << x << endl;
#define ii pair<int,int>
ostream& operator << (ostream &os, vector<int>&x) {
    for (int i = 0; i < x.size(); i++) os << x[i] << sp;
    return os;
}
ostream& operator << (ostream &os, pair<int, int> x) {
    cout << x.fi << sp << x.se << sp;
    return os;
}
ostream& operator << (ostream &os, vector<pair<int, int> >&x) {
    for (int i = 0; i < x.size(); i++) os << x[i] << endl;
    return os;
}

int n, W;
pair<int, int> a[N];
pair<int, int> dp[N][10 * N];
const int mod = 1e9 + 7;

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n >> W;
    for (int i = 1; i <= n; i++) cin >> a[i].fi >> a[i].se;
    dp[0][0] = mp(0, 1);
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= W; j++) {
            dp[i][j] = dp[i - 1][j];
            if (j >= a[i].fi) {
                if (dp[i][j].fi < dp[i - 1][j - a[i].fi].fi + a[i].se) {
                    dp[i][j].fi = dp[i - 1][j - a[i].fi].fi + a[i].se;
                    dp[i][j].se = dp[i - 1][j - a[i].fi].se;
                }
                else if (dp[i][j].fi == dp[i - 1][j - a[i].fi].fi + a[i].se) {
                    dp[i][j].se += dp[i - 1][j - a[i].fi].se;
                    dp[i][j].se %= mod;
                }
            }
        }
    }
    for (int i = 1; i <= W; i++) dp[n][i] = max(dp[n][i - 1], dp[n][i]);
    cout << dp[n][W].fi << sp << dp[n][W].se << endl;
}