#include<bits/stdc++.h>

using namespace std;

#define LL long long

#define mod 7777777

LL k, n, dp[];

struct Matrix {

    LL w[][];

} base;

struct Node {

    LL w[][];

} pool;

Matrix Cheng(Matrix a, Matrix b) {

    Matrix ans;

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

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

            ans.w[i][j] = ;

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

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

            for(int p = ; p <= k; p ++)

                ans.w[i][j] = (ans.w[i][j] + a.w[i][p] * b.w[p][j] % mod) % mod;

    return ans;

}

Matrix mpow(Matrix a, LL b) {

    Matrix ans;

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

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

            if(i == j)    ans.w[i][j] = ;

            else    ans.w[i][j] = ;

    for(; b; b >>= , a = Cheng(a, a))

        if(b & ) ans = Cheng(ans, a);

    return ans;

}

int main() {

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

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

    scanf("%lld%lld", &k, &n);

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

        for(int j = ; j <= k; j ++)    base.w[i][j] = ;

    for(int i = ; i <= k; i ++)    base.w[][i] = ;

    for(int i = ; i <= k; i ++)    base.w[i][i-] = ;

    dp[] = ;

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

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

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

    for(int i = ; i <= k; i ++)    pool.w[i][] = dp[k-i+];

    base = mpow(base, n-k);

    LL ans = ;

    for(int i = ; i <= k; i ++)    ans = (ans + base.w[][i] * pool.w[i][] % mod) % mod;

    printf("%lld", ans);

    return ;

}