#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  long long k;
  cin >> n >> k;
  int ara[n], i;
  long long fib[n + 5];
  for (i = 0; i < n; i++) ara[i] = i + 1;
  fib[0] = fib[1] = 1;
  for (i = 2; i < n + 5; i++) fib[i] = fib[i - 1] + fib[i - 2];
  for (i = 0; i < n - 1; i++) {
    if (fib[n - i - 1] >= k) continue;
    swap(ara[i], ara[i + 1]);
    k -= fib[n - i - 1];
  }
  for (i = 0; i < n; i++) cout << ara[i] << " ";
  cout << endl;
  return 0;
}
