#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <bitset>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define szz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
typedef tuple<int, int, int> t3;
typedef pair<ll, ll> pll;
typedef long double ldouble;
typedef pair<double, double> pdd;

const int MOD = 1e9 + 7;
int pw(int x, int y) {
	int res = 1;
	while(y) {
		if(y & 1) res = (ll)res * x % MOD;
		x = (ll)x * x % MOD;
		y >>= 1;
	}
	return res;
}

int N, K;
int D[110][10010];

void solve() {
	scanf("%d%d", &N, &K);
	ll ans = K * (K + 1) / 2;
	ans = ans * pw(K+1, N-1) % MOD;
	ans = ans * N % MOD;
	D[N+1][0] = 1;
	int mx = 0;
	for(int i=N;i;i--) {
		for(int j=-i;j<=K-i;j++) {
			for(int k=0;k<=mx;k++) {
				int nk = k;
				if(j <= 0 && -j <= k) {
					nk = (k + (k + j) / i + 1);
					ans = (ans - pw(K+1, i-1) * (ll)D[i+1][k] % MOD * (nk - k)) % MOD;
					if(ans < 0) ans += MOD;
				}
				D[i][nk] = (D[i][nk] + D[i+1][k]) % MOD;
				if(D[i][nk]) mx = max(mx, nk);
			}
		}
	}
	printf("%lld\n", ans);
}

int main(){
	int Tc = 1; // scanf("%d\n", &Tc);
	for(int tc=1;tc<=Tc;tc++){
		solve();
	}
	return 0;
}
