Cod sursă (job #715897)

#include <fstream>
#include <algorithm>
#include <queue>
#include <vector>

#define ll long long

/// define int long long

using namespace std;

ifstream in("2sah.in");
ofstream out("2sah.out");

const int MOD = 100003;
const int NMAX = 1005;
const char nl = '\n';

int q, n, k, a[NMAX][2 * NMAX], sum, f1, f2, f3, f4;

ll lgput(ll n, ll p){
    ll r = 1;
    while(p){
        if(p % 2 != 0)
            r = (r * n) % MOD;
        n = (n * n) % MOD;
        p = p / 2;
    }
    return r;
}

void solve1(){
    sum = 1;
    out << lgput(3, k - 1) % MOD << nl;
}

void solve2(){
}

int main(){
    in >> q >> n >> k;
    if(q == 1)
        solve1();
    else
        solve2();
    return 0;
}