<commit_before>/**
 * File    : E.cpp
 * Author  : <NAME>
 * Created : 2018-3-11 21:22:55
 * Powered by Visual Studio Code
 */

#include <iostream>
#include <iomanip>   // << fixed << setprecision(xxx)
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <vector>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <complex>
#include <tuple>
#include <queue>
#include <stack>
#include <map> // if (M.find(key) != M.end()) { }
#include <set>
#include <random> // random_device rd; mt19937 mt(rd());
#include <cctype>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;

#define DEBUG 0 // change 0 -> 1 if we need debug.

typedef long long ll;

// const ll dx[4] = {1, 0, -1, 0};
// const ll dy[4] = {0, 1, 0, -1};

// const ll C = 1e6+10;
// const ll M = 1000000007;

ll N, A, B;

bool ok()
{
  return (1 <= A && A <= N && 1 <= B && B <= N && A * B >= N);
}

vector<ll> V;
vector<ll> W;
map <ll, ll> M;

int main()
{
  cin >> N >> A >> B;
  if (!ok())
  {
    cout << -1 << endl;
    return 0;
  }<commit_msg>tried E.cpp to 'E'<commit_after>/**
 * File    : E.cpp
 * Author  : <NAME>
 * Created : 2018-3-11 21:22:55
 * Powered by Visual Studio Code
 */

#include <iostream>
#include <iomanip>   // << fixed << setprecision(xxx)
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <vector>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <complex>
#include <tuple>
#include <queue>
#include <stack>
#include <map> // if (M.find(key) != M.end()) { }
#include <set>
#include <random> // random_device rd; mt19937 mt(rd());
#include <cctype>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;

#define DEBUG 0 // change 0 -> 1 if we need debug.

typedef long long ll;

// const ll dx[4] = {1, 0, -1, 0};
// const ll dy[4] = {0, 1, 0, -1};

// const ll C = 1e6+10;
// const ll M = 1000000007;

ll N, A, B;

bool ok()
{
  return (1 <= A && A <= N && 1 <= B && B <= N && A + B <= N && A * B >= N);
}

vector<ll> V;
vector<ll> W;
map<ll, ll> M;

int main()
{
  cin >> N >> A >> B;
  if (!ok())
  {
    cout << -1 << endl;
    return 0;
  }
{'fraction_non_alphanumeric': 0.21190261496844004, 'fraction_numerical': 0.04418394950405771, 'mean_word_length': 3.0345454545454547, 'pattern_counts': {'":': 0, '<': 70, '<?xml version=': 0, '>': 61, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 2, 'word_list_counts': {'cursed_substrings.json': 2, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '77839', 'n_tokens_mistral': 975, 'n_tokens_neox': 897, 'n_words': 289}