#include <bits/stdc++.h>
using namespace std;
long long f[55];
int n;
long long k;
void solve(int x, long long last) {
  if (x > n) return;
  if (f[n - x] >= last) {
    printf("%d ", x);
    solve(x + 1, last);
  } else {
    printf("%d %d ", x + 1, x);
    solve(x + 2, last - f[n - x]);
  }
}
int main() {
  scanf("%d%I64d", &n, &k);
  f[0] = 1;
  f[1] = 1;
  f[2] = 2;
  for (int i = 3; i <= n; i++) {
    f[i] = f[i - 1] + f[i - 2];
  }
  solve(1, k);
  return 0;
}
