#include <bits/stdc++.h>
using namespace std;
const int maxn = 55;
const int inf = 0x3f3f3f3f;
long long fib[1005];
void init() {
  fib[0] = 0;
  fib[1] = 1;
  fib[2] = 2;
  for (int i = 3; i < 1005; i++) fib[i] = fib[i - 1] + fib[i - 2];
}
int n;
long long k;
int ans[105];
int main(void) {
  init();
  while (cin >> n >> k) {
    for (int i = 1; i <= 100; i++) ans[i] = i;
    k--;
    for (int i = 1; i < n; i++) {
      int cnt = n - i + 1;
      if (k <= fib[cnt] && k >= fib[cnt - 1]) {
        k -= fib[cnt - 1];
        swap(ans[i], ans[i + 1]);
        i++;
      }
    }
    for (int i = 1; i <= n; i++) {
      printf("%d ", ans[i]);
    }
    printf("\n");
  }
  return 0;
}
