#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int m, long long int n) {
  if (n == 0) return m;
  return gcd(n, m % n);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long fib[55];
  fib[0] = 1;
  fib[1] = 1;
  for (int i = 2; i < 55; i++) fib[i] = fib[i - 1] + fib[i - 2];
  long long n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    if (k <= fib[n - i - 1]) {
      cout << i + 1 << " ";
    } else {
      cout << i + 2 << " " << i + 1 << " ";
      k = k - fib[n - i - 1];
      i++;
    }
  }
  cout << endl;
  return 0;
}
