#include<bits/stdc++.h>

using namespace std;

#pragma comment(linker, "/STACK:102400000,102400000")

#define ls i<<1

#define rs ls | 1

#define mid ((ll+rr)>>1)

#define pii pair<int,int>

#define MP make_pair

typedef long long LL;

typedef unsigned long long ULL;

const long long INF = 1e18+1LL;

const double pi = acos(-1.0);

const int N = 7e5+, M = 1e3+,inf = 2e9;

const long long P=786433LL,mod = 786433LL;

const LL G=10LL;

LL mul(LL x,LL y){

    return (x*y-(LL)(x/(long double)P*y+1e-)*P+P)%P;

}

LL qpow(LL x,LL k){

    LL ret=;

    while(k){

        if(k&) ret=mul(ret,x);

        k>>=;

        x=mul(x,x);

    }

    return ret;

}

LL wn[];

void getwn(){

    for(int i=; i<=; ++i){

        int t=<<i;

        wn[i]=qpow(G,(P-)/t);

    }

}

int len;

void NTT(LL y[],int op){

    for(int i=,j=len>>,k; i<len-; ++i){

        if(i<j) swap(y[i],y[j]);

        k=len>>;

        while(j>=k){

            j-=k;

            k>>=;

        }

        if(j<k) j+=k;

    }

    int id=;

    for(int h=; h<=len; h<<=) {

        ++id;

        for(int i=; i<len; i+=h){

            LL w=;

            for(int j=i; j<i+(h>>); ++j){

                LL u=y[j],t=mul(y[j+h/],w);

                y[j]=u+t;

                if(y[j]>=P) y[j]-=P;

                y[j+h/]=u-t+P;

                if(y[j+h/]>=P) y[j+h/]-=P;

                w=mul(w,wn[id]);

            }

        }

    }

    if(op==-){

        for(int i=; i<len/; ++i) swap(y[i],y[len-i]);

        LL inv=qpow(len,P-);

        for(int i=; i<len; ++i) y[i]=mul(y[i],inv);

    }

}

LL dp[][N],tmp[N];

int n,h;

int main() {

    freopen("avl.in", "r", stdin);

    freopen("avl.out", "w", stdout);

    getwn();

    scanf("%d%d",&n,&h);

    dp[][] = ,dp[][] = ,dp[][] = ;

    len = ;

    for(int i = ; i <= h; ++i) {

        len = (<<(i+));

        NTT(dp[i-],);NTT(dp[i-],);

        for(int j = ; j < len; ++j)

            tmp[j] = (dp[i-][j] * dp[i-][j])%mod;

        NTT(tmp,-);

        for(int j = ; j < len; ++j)

            dp[i][j] = 2LL*tmp[j-] % mod;

         for(int j = ; j < len; ++j)

            tmp[j] = (dp[i-][j] * dp[i-][j])%mod;

         NTT(tmp,-);

         for(int j = ; j < len; ++j)

            dp[i][j] += tmp[j-], dp[i][j] %= mod;

        NTT(dp[i-],-);

        NTT(dp[i-],-);

    }

    printf("%lld\n",dp[h][n]);

    return ;

}