user:Giakhanhcophaitentoi

s=input()
s=s.split()
x=int(s[0])
n=int(s[1])
m=int(s[2])
t=((x*(n+1)-1)%(m(x-1)))//(x-1)
print(t)

include<bits/stdc++.h>

using namespace std;

bool uoc_nguyen_to (int n)
{
if (n < 2)
{
return false;
}

for (int i = 2; i <= sqrt(n); i++)
{
    if (n % i == 0)
    {
        return false;
    }
}

return true;

}
int main ()
{
int n;
cin >> n;
int sum = 0;

for (int i = 2; i <= sqrt (n); i++)
{
    if (uoc_nguyen_to(n)) 
        cout << i << " ";
        sum += i;
}

return 0;

}

a,b=map(int,input().split())
print(a**(1/b))

try hard

include<bits/stdc++.h>

define endl '\n'

using namespace std;
typedef long long ll;
const int xMax = (int)1e6 + 5;
int c[105];
int f[xMax];
int Try(int n, int x) {
if(x < 0) {
return (int)1e8;
}
if(x == 0) {
return 0;
}
if(f[x] != -1) {
return f[x];
}
int cnt = (int)1e8;
for(int i = 1; i <= n; ++i) {
cnt = min(cnt, Try(n, x - c[i]) + 1);
}
return f[x] = cnt;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, x;
cin >> n >> x;
for(int i = 1; i <= n; ++i) {
cin >> c[i];
}
fill(&f[1], &f[x + 1], -1);
int res = Try(n, x);
if(res == (int)1e8) {
res = -1;
}
cout << res;
return 0;
}

ngiu a Nhuận