#include <bits/stdc++.h>
const long long mod = 1000000007;
const int maxn = 100000;
using namespace std;
int main() {
  long long n, k;
  scanf("%I64d", &n);
  scanf("%I64d", &k);
  vector<long long> fib(n + 1);
  fib[1] = 1;
  for (int i = 2; i < n + 1; i++) fib[i] = fib[i - 1] + fib[i - 2];
  for (int i = 0; i < n; i++) {
    if (fib[n - i] < k) {
      cout << i + 2 << " " << i + 1 << " ";
      k -= fib[n - i];
      i++;
    } else
      cout << i + 1 << " ";
  }
  return 0;
}
