// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;
const int MOD = 1000000009;

int t;
int n, m;
ll fact[MAXN], ifact[MAXN];

ll ncr(ll n, ll r) {
    return fact[n] * ifact[r] % MOD * ifact[n - r] % MOD;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    fact[0] = 1;
    REP (i, 1, MAXN) {
        fact[i] = fact[i - 1] * i % MOD;
    }
    ifact[0] = ifact[1] = 1;
    REP (i, 2, MAXN) {
        ifact[i] = MOD - MOD / i * ifact[MOD % i] % MOD;
    }
    REP  (i, 2, MAXN) {
        ifact[i] = ifact[i - 1] * ifact[i] % MOD;
    }
    cin >> t;
    while (t--) {
        cin >> n >> m;
        if (m < 20) {
            int cur = 1 << m;
            REP (i, m, n) {
                cur--;
            }
            if (cur < 0) {
                cout << "bankrupt\n";
                continue;
            }
        }
        int ans = 0;
        REP (i, 0, m + 1) {
            cerr << n << ' ' << i << ": " << ncr(n, i) << '\n';
            ans += ncr(n, i);
            ans %= MOD;
        }
        cout << ans << '\n';
    }
    return 0;
}