#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <string>
#include <ctime>
typedef unsigned char byte;
#define pb push_back
#define input_fast std::ios::sync_with_stdio(false);std::cin.tie(0)
#define local freopen("in.txt","r",stdin)

using namespace std;
const int maxn = 1e3 + 50;
const long long mod = 123456781;
long long kp[maxn][maxn];
long long dp[maxn][35];

long long counter(int x,int y)
{
   if (kp[x][y] != -1) 
    return kp[x][y];
   long long & ans = kp[x][y];
   if (x == y || y == 0) return ans = 1;
   return ans = (counter(x-1,y-1) + counter(x-1,y) ) % mod;
}

long long dfs(int x,int y)
{
   if (dp[x][y] != -1)
    return dp[x][y];
   long long & ans = dp[x][y] = 0;
   if (y == 0) return (ans = (x==0));
   for(int i = 1 ; i <= x - y + 1 ; ++ i)
    {
        ans += counter(x,i) * dfs(x - i , y - 1);
        if (ans >= mod)
         ans %= mod;
    }
   return ans;
}


int main(int argc,char *argv[])
{
  int n , k ;
  memset(dp , -1 , sizeof(dp));
  memset(kp , -1 , sizeof(kp));
  while(~scanf("%d%d",&n,&k))
   {
         if (n < k) printf("0\n");
         else
         printf("%lld\n",dfs(n,k));
   }
  return 0;
}