#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>
using namespace std;

const int N = 2e5 + 5, inf = 1e9, mod = 1e9 + 9;
#define pb push_back
#define mp make_pair
#define ll long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define sz(x) (int)x.size()
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;

template<int M>
struct Mint {
  int x;
  Mint(): x(0) { }
  Mint(int y) {
    x = y % M;
    if (x < 0) x += M;
  }
  Mint(long long y) {
    x = y % M;
    if (x < 0) x += M;
  }
  int get() const {return x;}
  bool operator==(const Mint &r) const {return x==r.x;}
  Mint &operator+=(const Mint &r) {if((x+=r.x)>=M) x-=M; return *this;}
  Mint &operator-=(const Mint &r) {if((x+=M-r.x)>=M) x-=M; return *this;}
  Mint &operator*=(const Mint &r) {x=(long long)x*r.x%M; return *this;}
  Mint &operator/=(const Mint &r) {x=(long long)x*r.inv().x%M; return *this;}
  Mint operator+(const Mint &r) const {return Mint(*this)+=r;}
  Mint operator-(const Mint &r) const {return Mint(*this)-=r;}
  Mint operator*(const Mint &r) const {return Mint(*this)*=r;}
  Mint operator/(const Mint &r) const {return Mint(*this)/=r;}
  Mint inv() const {
    int a = x, b = M, u = 1, v = 0;
    while(b) {
      int t = a / b;
      a -= t * b; std::swap(a, b);
      u -= t * v; std::swap(u, v);
    }
    if(u < 0) u += M;
    Mint res; res.x = (unsigned)u;
    return res;
  }
};

typedef Mint<mod> mint;
mint fac[N], inv[N];

mint ncr(int n, int k){
    if(k > n)return mint(0ll);
    if(k == 0)return mint(1ll);
    return fac[n] * inv[k] * inv[n - k];
}
void solve(){
    int n, m;
    cin >> n >> m;

    if(pow(2, m) < n - m){
        cout << "bankrupt\n";
        return;
    }
    mint ans(0ll);
    for(int i = 0; i <= m; i++){
        ans += ncr(n, i);
    }
    cout << ans.x << '\n';
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t = 1;
    cin >> t;

    fac[0] = mint(1);
    for(int i = 1; i < N; i++){
        fac[i] = fac[i - 1] * mint(i);
        inv[i] = fac[i].inv();
    }
    while(t--){
        solve();
    }
    return 0;
}