#include <bits/stdc++.h>
using namespace std;
long long fac[51];
int num[51];
int main() {
  fac[0] = fac[1] = 1;
  int n;
  long long k;
  scanf("%d%lld", &n, &k);
  for (int i = 2; i <= n; i++) fac[i] = fac[i - 1] + fac[i - 2];
  for (int i = 1; i <= n; i++) num[i] = i;
  int now = n;
  while (k > 0 && now > 0) {
    if (fac[now - 1] < k) {
      k -= fac[now - 1];
      swap(num[n - now + 1], num[n - now + 2]);
      now -= 2;
    } else {
      now--;
    }
  }
  for (int i = 1; i <= n; i++) printf("%d ", num[i]);
  putchar('\n');
  return 0;
}
