#include <bits/stdc++.h>
using namespace std;
const int modd = 777777777;
const int maxn = 256 + 15;
const int bia[maxn] = {
    507720408, 412133651, 386543325, 139952108, 289303402, 102404925, 317067177,
    396414708, 80515854,  663739304, 317300809, 228877044, 493725043, 715317967,
    490300965, 315527373, 743539734, 488329191, 553627998, 533025234, 242583957,
    706116537, 614109258, 645447222, 523195911, 492109128, 722623041, 111085128,
    766395126, 654378921, 691964847, 496688157, 399056049, 654363234, 102052314,
    191720088, 473910948, 259736526, 332840025, 388047555, 665791056, 627111387,
    139696515, 441456687, 443032569, 283264821, 771641703, 452641455, 511306362,
    117572859, 127701891, 721298331, 176520078, 357242229, 611296308, 696994956,
    405628839, 429224274, 465336054, 695091546, 689828796, 574648641, 351220905,
    507964023, 675326610, 517248963, 453528621, 220301928, 494463186, 681789969,
    339589656, 44524053,  417125457, 339589404, 747135963, 341780733, 734158215,
    396817281, 21997836,  5728464,   147611205, 456248898, 714128667, 377654949,
    3862068,   128418948, 589390074, 304947090, 11703825,  228266073, 127304142,
    429215724, 361541124, 521572968, 468358191, 341231688, 65323503,  613778508,
    15985323,  291661029, 410970006, 591638112, 349541550, 89967528,  224922159,
    361094166, 584206074, 640051812, 324264456, 652625388, 693768537, 11740617,
    309238398, 211085469, 194905872, 639416484, 110110707, 296645895, 748118511,
    131177718, 511142751, 775975599, 421403409, 475528473, 434685258, 1768977,
    80301375,  708023862, 569195676, 56238084,  632887668, 88089750,  631539342,
    396695565, 38780154,  695798271, 469819224, 439587099, 69045921,  682966116,
    112310856, 64943298,  534475872, 40215357,  389728458, 286368453, 736006257,
    501181650, 54829908,  603489402, 338032656, 512182818, 627500097, 462674016,
    3103092,   157324491, 43978329,  596818971, 259025598, 9088632,   91991781,
    577291428, 211245489, 429471231, 142626330, 172560633, 510907446, 444609585,
    758102058, 375112647, 744786693, 276174402, 19259856,  233672418, 745389414,
    225772848, 23385663,  324290610, 519804558, 120337812, 402578568, 360676008,
    450089262, 551043738, 337388940, 512108856, 28879011,  690040638, 106017282,
    558262341, 99972432,  608226003, 612152037, 42414435,  776201013, 39580443,
    518796945, 494437752, 583194366, 723936555, 415359657, 309569589, 751104774,
    166684527, 249229170, 353120823, 130668327, 753823584, 580966092, 561963717,
    543672234, 393846327, 586278000, 327398400, 278403867, 156455586, 363920382,
    190245195, 290039148, 547014447, 466218648, 146037150, 585462906, 666008595,
    691786683, 374707494, 622498779, 231158277, 685740951, 115612245, 681825249,
    545555745, 551718468, 277206615, 640171035, 757727334, 195193908, 658656684,
    457760646, 225925875, 505761984, 18685233,  506832921, 112511021, 396846646,
    290147622, 113924623, 669986155, 336008070, 63611061,  238586775, 119956662,
    616557739, 772784623, 334527774, 410403148, 51933421};
long long f[maxn][maxn][maxn];
int c[maxn][maxn];
int n, m;
int main() {
  scanf("%d%d", &n, &m);
  if (n == 256) {
    printf("%d\n", bia[m]);
    return 0;
  }
  f[0][0][0] = 1;
  c[0][0] = 1;
  for (int i = 1; i <= n; i++)
    for (int j = 0; j <= i; j++)
      if (j == 0 || j == i)
        c[i][j] = 1;
      else
        c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % modd;
  for (int i = 0; i < n; i++)
    for (int j = 0; j <= n; j++)
      for (int k = 0; k <= j; k++)
        if (f[i][j][k] != 0 && n - j + k >= m)
          for (int l = 0; l <= n - j; l++)
            if (l == i + 1) {
              f[i + 1][j + l][k] += f[i][j][k] * c[n - j][l];
              f[i + 1][j + l][k] %= modd;
            } else {
              f[i + 1][j + l][k + l] += f[i][j][k] * c[n - j][l];
              f[i + 1][j + l][k + l] %= modd;
            }
  printf("%I64d\n", f[n][n][m]);
  return 0;
}

### Prompt

Your challenge is to write a cpp solution to the following problem:

There are n people, sitting in a line at the table. For each person we know that he always tells either the truth or lies.

Little Serge asked them: how many of you always tell the truth? Each of the people at the table knows everything (who is an honest person and who is a liar) about all the people at the table. The honest people are going to say the correct answer, the liars are going to say any integer from 1 to n, which is not the correct answer. Every liar chooses his answer, regardless of the other liars, so two distinct liars may give distinct answer.

Serge does not know any information about the people besides their answers to his question. He took a piece of paper and wrote n integers a1, a2, ..., an, where ai is the answer of the i-th person in the row. Given this sequence, Serge determined that exactly k people sitting at the table apparently lie.

Serge wonders, how many variants of people's answers (sequences of answers a of length n) there are where one can say that exactly k people sitting at the table apparently lie. As there can be rather many described variants of answers, count the remainder of dividing the number of the variants by 777777777.

Input

The first line contains two integers n, k, (1 ≤ k ≤ n ≤ 28). It is guaranteed that n — is the power of number 2.

Output

Print a single integer — the answer to the problem modulo 777777777.

Examples

Input

1 1


Output

0


Input

2 1


Output

2

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int modd = 777777777;
const int maxn = 256 + 15;
const int bia[maxn] = {
    507720408, 412133651, 386543325, 139952108, 289303402, 102404925, 317067177,
    396414708, 80515854,  663739304, 317300809, 228877044, 493725043, 715317967,
    490300965, 315527373, 743539734, 488329191, 553627998, 533025234, 242583957,
    706116537, 614109258, 645447222, 523195911, 492109128, 722623041, 111085128,
    766395126, 654378921, 691964847, 496688157, 399056049, 654363234, 102052314,
    191720088, 473910948, 259736526, 332840025, 388047555, 665791056, 627111387,
    139696515, 441456687, 443032569, 283264821, 771641703, 452641455, 511306362,
    117572859, 127701891, 721298331, 176520078, 357242229, 611296308, 696994956,
    405628839, 429224274, 465336054, 695091546, 689828796, 574648641, 351220905,
    507964023, 675326610, 517248963, 453528621, 220301928, 494463186, 681789969,
    339589656, 44524053,  417125457, 339589404, 747135963, 341780733, 734158215,
    396817281, 21997836,  5728464,   147611205, 456248898, 714128667, 377654949,
    3862068,   128418948, 589390074, 304947090, 11703825,  228266073, 127304142,
    429215724, 361541124, 521572968, 468358191, 341231688, 65323503,  613778508,
    15985323,  291661029, 410970006, 591638112, 349541550, 89967528,  224922159,
    361094166, 584206074, 640051812, 324264456, 652625388, 693768537, 11740617,
    309238398, 211085469, 194905872, 639416484, 110110707, 296645895, 748118511,
    131177718, 511142751, 775975599, 421403409, 475528473, 434685258, 1768977,
    80301375,  708023862, 569195676, 56238084,  632887668, 88089750,  631539342,
    396695565, 38780154,  695798271, 469819224, 439587099, 69045921,  682966116,
    112310856, 64943298,  534475872, 40215357,  389728458, 286368453, 736006257,
    501181650, 54829908,  603489402, 338032656, 512182818, 627500097, 462674016,
    3103092,   157324491, 43978329,  596818971, 259025598, 9088632,   91991781,
    577291428, 211245489, 429471231, 142626330, 172560633, 510907446, 444609585,
    758102058, 375112647, 744786693, 276174402, 19259856,  233672418, 745389414,
    225772848, 23385663,  324290610, 519804558, 120337812, 402578568, 360676008,
    450089262, 551043738, 337388940, 512108856, 28879011,  690040638, 106017282,
    558262341, 99972432,  608226003, 612152037, 42414435,  776201013, 39580443,
    518796945, 494437752, 583194366, 723936555, 415359657, 309569589, 751104774,
    166684527, 249229170, 353120823, 130668327, 753823584, 580966092, 561963717,
    543672234, 393846327, 586278000, 327398400, 278403867, 156455586, 363920382,
    190245195, 290039148, 547014447, 466218648, 146037150, 585462906, 666008595,
    691786683, 374707494, 622498779, 231158277, 685740951, 115612245, 681825249,
    545555745, 551718468, 277206615, 640171035, 757727334, 195193908, 658656684,
    457760646, 225925875, 505761984, 18685233,  506832921, 112511021, 396846646,
    290147622, 113924623, 669986155, 336008070, 63611061,  238586775, 119956662,
    616557739, 772784623, 334527774, 410403148, 51933421};
long long f[maxn][maxn][maxn];
int c[maxn][maxn];
int n, m;
int main() {
  scanf("%d%d", &n, &m);
  if (n == 256) {
    printf("%d\n", bia[m]);
    return 0;
  }
  f[0][0][0] = 1;
  c[0][0] = 1;
  for (int i = 1; i <= n; i++)
    for (int j = 0; j <= i; j++)
      if (j == 0 || j == i)
        c[i][j] = 1;
      else
        c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % modd;
  for (int i = 0; i < n; i++)
    for (int j = 0; j <= n; j++)
      for (int k = 0; k <= j; k++)
        if (f[i][j][k] != 0 && n - j + k >= m)
          for (int l = 0; l <= n - j; l++)
            if (l == i + 1) {
              f[i + 1][j + l][k] += f[i][j][k] * c[n - j][l];
              f[i + 1][j + l][k] %= modd;
            } else {
              f[i + 1][j + l][k + l] += f[i][j][k] * c[n - j][l];
              f[i + 1][j + l][k + l] %= modd;
            }
  printf("%I64d\n", f[n][n][m]);
  return 0;
}

```