#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
long long p[55];
int id[55];
void pre() {
  p[1] = 1;
  p[2] = 2;
  for (int i = 3; i < 55; i++) p[i] = p[i - 1] + p[i - 2];
}
void judge(int *A, int n, long long k) {
  if (n == 0) return;
  if (n == 1) {
    printf("%d ", A[1]);
    return;
  }
  if (k <= p[n - 1]) {
    printf("%d ", A[1]);
    judge(A + 1, n - 1, k);
  } else {
    printf("%d ", A[2]);
    printf("%d ", A[1]);
    judge(A + 2, n - 2, k - p[n - 1]);
  }
}
int main() {
  pre();
  int n;
  long long k;
  gn(n);
  gn(k);
  for (int i = 1; i <= n; i++) id[i] = i;
  judge(id, n, k);
  return 0;
}
